Hereditary properties of combinatorial structures: Posets and oriented graphs

DOI10.1002/jgt.20266zbMath1135.05024arXivmath/0702350OpenAlexW2950647997MaRDI QIDQ5434263

Béla Bollobás, Robert Morris, József Balogh

Publication date: 4 January 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0702350

zbMATH Keywords

posettournamenthereditary property

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Jumps in speeds of hereditary properties in finite relational languages ⋮ A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

Cites Work

• Unnamed Item
• Hereditary properties of tournaments
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• The average number of linear extensions of a partial order

This page was built for publication: Hereditary properties of combinatorial structures: Posets and oriented graphs