A Note on Bipartite Graph Tiling

DOI10.1137/100788203zbMath1237.05108arXiv1104.2099OpenAlexW2003436364MaRDI QIDQ3225134

Louis DeBiasio, Andrzej Czygrinow

Publication date: 15 March 2012

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

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

zbMATH Keywords

packingfactorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (4)

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: A Note on Bipartite Graph Tiling