Premium
Some unavoidable subdigraphs of tournaments
Author(s) -
Petrović Vojislav
Publication year - 1988
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190120304
Subject(s) - tournament , combinatorics , mathematics , simple (philosophy) , arc (geometry) , path (computing) , discrete mathematics , geometry , computer science , philosophy , computer network , epistemology
Let H ( n, i ) be a simple ( n − 1)‐path v 1 → v 2 → … → v n with an additional arc v 1 v i (3 ⩽ i ⩽ n ). We prove that for each n and i (3 ⩽ i ⩽ n ), with few exceptions, every n ‐tournament T n contains a copy of H ( n, i ).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom