Note on Bipartite Graph Tilings

DOI10.1137/080726434zbMath1213.05138arXiv0806.1192OpenAlexW3104325023MaRDI QIDQ5392896

Jan Hladký, Mathias Schacht

Publication date: 15 April 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal graph theoryTurán-type problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal combinatorics (05D99)

Related Items (5)

Minimum degree thresholds for bipartite graph tiling ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case

This page was built for publication: Note on Bipartite Graph Tilings