Skip to main content
Log in

Long induced paths and cycles in Kneser graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We present some lower and upper bounds on the length of the maximum induced paths and cycles in Kneser graphs.

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.

Similar content being viewed by others

References

  1. Bollobás, B.: On generalized graphs. Acta Math. Acad. Sci. Hung.16, 447–452 (1965)

    Google Scholar 

  2. Frankl, P.: An Extremal Problem for two Families of Sets. Europ. J. Comb.3, 125–127 (1982)

    Google Scholar 

  3. Frankl, P., Furedi, Z.: Extremal problems concerning Kneser graphs. J. Comb. Theory (B)40, 270–284 (1986)

    Google Scholar 

  4. Lovász, L.: Kneser's conjecture, chromatic number and homotopy. J. Comb. Theory (A)25, 319–324 (1978)

    Google Scholar 

  5. Poljak, S., Tuza, Z.: Maximum bipartite subgraphs of Kneser graphs. Graphs and Combinatorics3, 191–199 (1987)

    Google Scholar 

  6. Kohayakawa, Y.: A note on Induced Cycles in Kneser graphs. to appear.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alles, P., Poljak, S. Long induced paths and cycles in Kneser graphs. Graphs and Combinatorics 5, 303–306 (1989). https://doi.org/10.1007/BF01788684

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation