Hostname: page-component-7c8c6479df-fqc5m Total loading time: 0 Render date: 2024-03-19T07:01:36.379Z Has data issue: false hasContentIssue false

Ore-type graph packing problems

Published online by Cambridge University Press:  20 September 2006

A. V. KOSTOCHKA
Affiliation:
Department of Mathematics, University of Illinois, Urbana, IL 61801, USA Institute of Mathematics, Novosibirsk, 630090, Russia (e-mail: kostochk@math.uiuc.edu, gexinyu@math.uiuc.edu)
G. YU
Affiliation:
Department of Mathematics, University of Illinois, Urbana, IL 61801, USA

Extract

We say that $n$-vertex graphs $G_1,G_2,\ldots,G_k$pack if there exist injective mappings of their vertex sets onto $[n] = \{1, \ldots,n \}$ such that the images of the edge sets do not intersect. The notion of packing allows one to make some problems on graphs more natural or more general. Clearly, two $n$-vertex graphs $G_1$ and $G_2$ pack if and only if $G_1$ is a subgraph of the complement $\overline{G}_2$ of $G_2$.

Type
PROBLEM SECTION
Copyright
© 2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)