A note on induced cycles in Kneser graphs
From MaRDI portal
Publication:1180426
DOI10.1007/BF01205076zbMath0755.05052MaRDI QIDQ1180426
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Related Items
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Intersection patterns of convex sets
- Extremal problems concerning Kneser-graphs
- An extremal problem for sets with applications to graph theory
- Covering graphs by the minimum number of equivalence relations
- Maximum bipartite subgraphs of Kneser graphs
- On a clique covering problem of Orlin
- An extremal problem for two families of sets
- A short proof of Kneser's conjecture
- Long induced paths and cycles in Kneser graphs
- Matchings and covers in hypergraphs
- On complete subgraphs of different orders
- The Representation of a Graph by Set Intersections