Tilings in vertex ordered graphs
From MaRDI portal
Publication:2131863
DOI10.1016/j.jctb.2022.02.006zbMath1487.05137arXiv2007.10832OpenAlexW4214827222MaRDI QIDQ2131863
Andrew Treglown, Lina Li, József Balogh
Publication date: 27 April 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.10832
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- On circuits in graphs
- Davenport-Schinzel theory of matrices
- Blow-up lemma
- A positive fraction Erdős-Szekeres theorem
- Tiling Turán theorems
- On the Turán number of some ordered even cycles
- \(H\)-factors in dense graphs
- The minimum degree threshold for perfect graph packings
- Edge-ordered Ramsey numbers
- Ordered and convex geometric trees with linear extremal function
- \(F\)-factors in hypergraphs via absorption
- Forbidden paths and cycles in ordered graphs and matrices
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Critical chromatic number and the complexity of perfect packings in graphs
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- Dirac-type results for tilings and coverings in ordered graphs
- Extremal theory of vertex or edge ordered graphs
- On the structure of linear graphs
- Ordered Ramsey numbers
- Ramsey numbers of ordered graphs
- On the Turán number of ordered forests
- Proof of the Alon-Yuster conjecture
This page was built for publication: Tilings in vertex ordered graphs
