id:A122027 - OEIS Search Results

Search: id:A122027

Displaying 1-1 of 1 results found.

page 1

Largest integer m so that every n-tournament contains a transitive (i.e. acyclic) sub-tournament with at least m vertices.

+0
2

1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`K. B. Reid, Tournaments, in Handbook of Graph Theory; see p. 167.`
	LINKS	`W. D. Smith, Partial Answer to Puzzle #21: Getting rid of cycles in directed graphs` `Yahoo Groups, Range Voting`
	CROSSREFS	`Cf. A122026.` `Sequence in context: A029837 A070939 A113473 this_sequence A112751 A091194 A061555` `Adjacent sequences: A122024 A122025 A122026 this_sequence A122028 A122029 A122030`
	KEYWORD	`nonn`
	AUTHOR	`Warren D. Smith, warren.wds(AT)gmail.com, Sep 11 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.