Tiling problems in edge-ordered graphs (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-010MaRDI QIDQ7000368zbMATH OpenFDO

Authors Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang

Publication date 8 April 2025

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-010

zbMATH Keywords

universally tileable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 2147937 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Dirac-type results for tilings and coverings in ordered graphs
• Increasing paths in edge ordered graphs
• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• Monotone paths in dense edge-ordered graphs
• Nearly-linear monotone paths in edge-ordered graphs
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture
• Some Combinatorial Theorems on Monotonicity
• Statistics of orderings
• The minimum degree threshold for perfect graph packings
• Tiling Turán theorems
• Tilings in vertex ordered graphs
• Turán problems for edge-ordered graphs
• \(F\)-factors in hypergraphs via absorption
• \(H\)-factors in dense graphs

This page was built for publication: Tiling problems in edge-ordered graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000368)