Skip to main content
Log in

An Ore-type analogue of the Sauer-Spencer Theorem

Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if Δ (G1) Δ (G2)  <  0.5n, then G1 and G2 pack.

In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G)  =  max{d(u) + d(v): uvE(G)}. We show that if θ(G1)Δ(G2) < n, then G1 and G2 pack. We also characterize the pairs (G1,G2) of n-vertex graphs satisfying θ(G1)Δ(G2) = n that do not pack.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bollobás, B.: Extremal Graph Theory, Academic Press, London, 1978

  • Bollobás, B., Eldridge, S.E.: Packing of graphs and applications to computational complexity, J. Comb. Theory Ser, B, 25, 105–124 (1978)

    Google Scholar 

  • Catlin, P.A.: Subgraphs of graphs. I. Discrete Math. 10, 225–233 (1974)

    Google Scholar 

  • Dirac, G.: Some theorems on abstract graphs, Proc. London Math. Soc., 2, 69–81 (1952)

  • Enomoto, H.: On the existence of disjoint cycles in a graph, Combinatorica 18, 487–492 (1998)

    Google Scholar 

  • Kaul, H., Kostochka, A.: Extremal graphs for a graph packing theorem of Sauer and Spencer, to appear in Combinatorics, Probability and Computing

  • Kaul, H., Kostochka, A., Yu, G.: On a graph packing conjecture by Bollobás, Eldridge and Catlin, submitted

  • Li, H., Woźniak, M.: A note on graphs containing all trees of a given size, Preprint MD 007 (2005), www.ii.nj.edu.pl/preMD/

  • Ore, O.: Note on Hamilton circuits, Am. Math. Monthly, 67, 55 (1960)

    Google Scholar 

  • Sauer, N., Spencer, J.: Edge disjoint placement of graphs, J. Combin. Theory Ser. B, 25, 295–302 (1978)

    Google Scholar 

  • Wang, H.: On the maximum number of independent cycles in a graph, Discrete Math. 205, 183–190 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gexin Yu.

Additional information

This work was supported in part by NSF grant DMS-0400498. The work of the first author was also partly supported by grant 05-01-00816 of the Russian Foundation for Basic Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kostochka, A., Yu, G. An Ore-type analogue of the Sauer-Spencer Theorem. Graphs and Combinatorics 23, 419–424 (2007). https://doi.org/10.1007/s00373-007-0732-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-007-0732-1

Keywords

Navigation