Tight embeddings of partial quadrilateral packings

DOI10.1016/J.JCTA.2009.06.003zbMath1209.05180OpenAlexW2030721953MaRDI QIDQ965225

Zoltan Fueredi, Jenő Lehel

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.06.003

zbMATH Keywords

packingsgraphsquadrilaterals\(H\)-designs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Small embeddings for partial 5-cycle systems ⋮ On deficiency problems for graphs ⋮ Completing partial packings of bipartite graphs

Cites Work

• List-colourings of graphs
• Dimension versus size
• Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
• A partial \(2k\)-cycle system of order \(n\) can be embedded in a \(2k\)-cycle system of order \(kn+c(k),k\geqslant 3\), where \(c(k)\) is a quadratic function of \(k\)
• Asymptotically good list-colorings
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Near-optimal list colorings
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight embeddings of partial quadrilateral packings