Asymptotic Enumeration of I3-free Digraphs
Abstract
We prove that almost all digraphs not embedding an independent set of size 3 consist of two disjoint tournaments, and discuss connections with the theory of homogeneous simple structures.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.