On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
Authors:
- Daniela KühnDKDaniela Kühn
- Deryk OsthusDODeryk Osthus
- Timothy TownsendTTTimothy Townsend
- Yi ZhaoYZYi Zhao
- 1 May 2017
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 124, 88-127
Abstract
No abstract availableAll Related Versions
Funding Information
- National Security Agency (H98230-12-1-0283)
- European Research Council (258345, 306349)
- Seventh Framework Programme (FP/2007–2013)
- Neurosciences Foundation (DMS-1400073)
This publication has 18 references indexed in Scilit:
- Independent sets in hypergraphsJournal of the American Mathematical Society, 2014
- Almost all triangle-free triple systems are tripartiteCombinatorica, 2012
- The fine structure of octahedron-free graphsJournal of Combinatorial Theory, Series B, 2011
- The number of K
s,t
-free graphsJournal of the London Mathematical Society, 2011
- The typical structure of graphs without given excluded subgraphsRandom Structures & Algorithms, 2008
- Hereditary properties of combinatorial structures: Posets and oriented graphsJournal of Graph Theory, 2007
- Hereditary Properties of TournamentsThe Electronic Journal of Combinatorics, 2007
- The Number Of Orientations Having No Fixed TournamentCombinatorica, 2006
- Testing subgraphs in directed graphsJournal of Computer and System Sciences, 2004
- The number of graphs without forbidden subgraphsJournal of Combinatorial Theory, Series B, 2004