Counting ordered graphs that avoid certain subgraphs

DOI10.1016/j.disc.2016.01.007zbMath1334.05063OpenAlexW2286633387MaRDI QIDQ279199

László Ozsvárt

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.01.007

zbMATH Keywords

orthogonalitybijective proofordered graphSchröder number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ordered sets (06A99)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On pattern-avoiding partitions
• On growth rates of permutations, set partitions, ordered graphs and other objects
• Davenport-Schinzel theory of matrices
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• Enumeration of ladder graphs
• Forbidden paths and cycles in ordered graphs and matrices
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Combinatorics of Permutations
• Partial matchings and pattern avoidance