Abstract
We present some lower and upper bounds on the length of the maximum induced paths and cycles in Kneser graphs.
Similar content being viewed by others
References
Bollobás, B.: On generalized graphs. Acta Math. Acad. Sci. Hung.16, 447–452 (1965)
Frankl, P.: An Extremal Problem for two Families of Sets. Europ. J. Comb.3, 125–127 (1982)
Frankl, P., Furedi, Z.: Extremal problems concerning Kneser graphs. J. Comb. Theory (B)40, 270–284 (1986)
Lovász, L.: Kneser's conjecture, chromatic number and homotopy. J. Comb. Theory (A)25, 319–324 (1978)
Poljak, S., Tuza, Z.: Maximum bipartite subgraphs of Kneser graphs. Graphs and Combinatorics3, 191–199 (1987)
Kohayakawa, Y.: A note on Induced Cycles in Kneser graphs. to appear.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01788684