Long induced paths and cycles in Kneser graphs (Q1263600): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587392 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
Normal rank | |||
Revision as of 08:17, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Long induced paths and cycles in Kneser graphs |
scientific article |
Statements
Long induced paths and cycles in Kneser graphs (English)
0 references
1989
0 references
The Kneser graph K(n,r) is the graph whose vertex set is the family of all r-element subsets of \(\{\) 1,2,...,n\(\}\), and a pair of vertices forms an edge if the corresponding subsets are disjoint. The authors present some lower and upper bounds on the length of the maximum induced paths and cycles in Kneser graphs.
0 references
Kneser graph
0 references
paths
0 references
cycles
0 references
