Skip to main content
SpringerLink
Log in

A class of dimension-skipping graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Forn≧6 there exists a graphG with dimG=n, dimG*≧n+2, whereG* isG with a certain edge added.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Lovász, J. Nešetřil andA. Pultr, On a Product Dimension of Graphs,Journal of Combinatorial Theory, B,29 (1980), 47–67.

    Article  MATH  Google Scholar 

  2. J. Nešetřil andA. Pultr, A Dushnik—Miller type dimension of graphs and its complexity, in:Fundamentals of Computation Theory, Lecture Notes in Comp. Sic. 56, Springer-Verlag, Berlin-New York, (1977), 482–493.

    Google Scholar 

  3. J. Nešetřil andV. Rödl, A simple proof of the Galvin—Ramsey property of the class of all finite graphs and a dimension of a graph,Discr. Math. 23 (1978), 49–55.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Matematicko-fyzikálni Fakulta, Univerzity Karlovy, Sokolovská 83, 18600, Praha 8, ČSSR

    Igor Kříž

Authors
  1. Igor Kříž
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kříž, I. A class of dimension-skipping graphs. Combinatorica 4, 317–319 (1984). https://doi.org/10.1007/BF02579142

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579142

AMS subject classification 1980

Search

Navigation