Sufficient conditions for perfect mixed tilings

DOI10.1016/J.JCTB.2024.08.007MaRDI QIDQ6652093zbMATH OpenFDO

Authors Felix Joos, Richard Lang

Publication date 12 December 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.08.007

zbMATH Keywords

minimum degree conditionsperfect tiling

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A degree sequence version of the Kühn-Osthus tiling theorem
• Tilings in randomly perturbed dense graphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu

Cites work

• \(F\)-factors in hypergraphs via absorption
• \(H\)-factors in dense graphs
• A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
• A degree sequence Hajnal-Szemerédi theorem
• A degree sequence Komlós theorem
• A degree sequence version of the Kühn-Osthus tiling theorem
• A discrepancy version of the Hajnal-Szemerédi theorem
• A geometric theory for hypergraph matching
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Almost-spanning subgraphs with bounded degree in dense graphs
• An Ore-type theorem for perfect packings in graphs
• An Ore-type theorem on equitable coloring
• Asymptotic multipartite version of the Alon-Yuster theorem
• Blow-up lemma
• Consecutive integers in high-multiplicity sumsets
• Dirac-type results for tilings and coverings in ordered graphs
• Dirac-type theorems in random hypergraphs
• Embedding spanning subgraphs in uniformly dense and inseparable graphs
• Extremal problems for finite sets
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Large planar subgraphs in dense graphs
• Minimum degree conditions for tight Hamilton cycles
• Note on Hamilton Circuits
• On sufficient conditions for spanning structures in dense graphs
• Packing k-partite k-uniform hypergraphs
• Proof of a tiling conjecture of Komlós
• Proof of the Alon-Yuster conjecture
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The bandwidth theorem for locally dense graphs
• The minimum degree threshold for perfect graph packings
• Tiling directed graphs with tournaments
• Tiling Turán theorems
• Tilings in vertex ordered graphs

Cited in

(1)

• On perfect subdivision tilings

This page was built for publication: Sufficient conditions for perfect mixed tilings

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