The extremal function for partial bipartite tilings

DOI10.1016/j.ejc.2011.09.026zbMath1239.05102arXiv0910.1064OpenAlexW2160923989MaRDI QIDQ412273

Jan Hladký, Codruţ Grosu

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.1064

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (5)

Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ A median-type condition for graph tiling ⋮ A Degree Sequence Komlós Theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ A degree sequence Hajnal-Szemerédi theorem

Cites Work

• Blow-up lemma
• Tiling Turán theorems
• On maximal paths and circuits of graphs
• Embedding large subgraphs into dense graphs
• A Density Corrádi–Hajnal Theorem
• On Independent Complete Subgraphs in a Graph
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The extremal function for partial bipartite tilings