Note: Tight embeddings of partial quadrilateral packings

Authors:
Zoltán Füredi;Jenő Lehel
Affiliations:
Alfréd Rényi Institute, Hungarian Academy of Sciences, Budapest, PO Box 127, Hungary, H-1364 and Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, ...;Department of Mathematical Sciences, The University of Memphis, Memphis, TN, USA and Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
Journal of Combinatorial Theory Series A
Year:
2010

Citing 7
Cited 1

Asymptotically good list-colorings

Journal of Combinatorial Theory Series A
Near optimal list colorings

Proceedings of the ninth international conference on on Random structures and algorithms
Introduction to Coding Theory

Introduction to Coding Theory
A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn + c(k),k ≥ 3, where c(k) is a quadratic function of k

Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs

Combinatorics, Probability and Computing
A small embedding for partial 4-cycle systems when the leave is small

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph

Journal of Graph Theory

Completing partial packings of bipartite graphs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let f(n;C"4) be the smallest integer such that, given any set of edge disjoint quadrilaterals on n vertices, one can extend it into a complete quadrilateral decomposition by including at most f(n;C"4) additional vertices. It is known, and it is easy to show, that n-1=