The extremal function for partial bipartite tilings

DOI10.1016/J.EJC.2011.09.026zbMATH Open1239.05102arXiv0910.1064OpenAlexW2160923989MaRDI QIDQ412273FDOQ412273

Jan Hladký, Codruţ Grosu

Publication date: 4 May 2012

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

Abstract: For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains $(1-o(1))c/v(H)n$ vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~�color{[Combinatorica 20 (2000), 203-218}]

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

Recommendations

• A note on bipartite graph tiling
• Note on bipartite graph tilings
• scientific article; zbMATH DE number 1504595
• Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
• Publication:4502540
• Bounded valence excess and the parabolicity of tilings
• The extremal function for unbalanced bipartite minors
• Tilings, packings, coverings, and the approximation of functions
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Integer Partitions, Tilings of2D-gons and Lattices

Mathematics Subject Classification ID

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

Cites Work

• Tiling Turán theorems
• On maximal paths and circuits of graphs
• Embedding large subgraphs into dense graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure of linear graphs
• Blow-up lemma
• On a problem of K. Zarankiewicz
• Title not available (Why is that?)
• A Density Corrádi–Hajnal Theorem
• On Independent Complete Subgraphs in a Graph

Cited In (6)

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

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

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