Tiling dense hypergraphs (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-097MaRDI QIDQ6997029zbMATH OpenFDO

Authors Richard Lang

Publication date 15 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-097

zbMATH Keywords

perfect tilings in hypergraphsrainbow structuresvertex orderings

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Cites work

• \(F\)-factors in hypergraphs via absorption
• A geometric theory for hypergraph matching
• Dirac-type results for tilings and coverings in ordered graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Embedding spanning bipartite graphs of small bandwidth
• Hamiltonian degree sequences in digraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• On extremal problems of graphs and generalized graphs
• On perfect matchings in \(k\)-complexes
• On sufficient conditions for spanning structures in dense graphs
• Packing k-partite k-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Recent advances on Dirac-type problems for hypergraphs
• The minimum degree threshold for perfect graph packings
• Tiling Turán theorems
• Transversal factors and spanning trees

This page was built for publication: Tiling dense hypergraphs (extended abstract)

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