The extremal function for partial bipartite tilings
From MaRDI portal
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 vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~�color{[Combinatorica 20 (2000), 203-218}]
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.
- scientific article; zbMATH DE number 1504589
- 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
Cites work
- scientific article; zbMATH DE number 1341922 (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?)
- A Density Corrádi–Hajnal Theorem
- Blow-up lemma
- Embedding large subgraphs into dense graphs
- On Independent Complete Subgraphs in a Graph
- On a problem of K. Zarankiewicz
- On maximal paths and circuits of graphs
- On the structure of linear graphs
- Tiling Turán theorems
Cited in
(7)- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- A degree sequence Hajnal-Szemerédi theorem
- Tiling directed graphs with tournaments
- A note on bipartite graph tiling
- Note on bipartite graph tilings
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- A degree sequence Komlós theorem
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)