The toughness of Kneser graphs

2021 ◽  
Vol 344 (9) ◽  
pp. 112484
Author(s):  
Davin Park ◽  
Anthony Ostuni ◽  
Nathan Hayes ◽  
Amartya Banerjee ◽  
Tanay Wakhare ◽  
...  
Keyword(s):  
Kneser Graphs

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k

2021 ◽  
Vol 344 (7) ◽  
pp. 112430
Author(s):  
Johann Bellmann ◽  
Bjarne Schülke
Keyword(s):  
Short Proof ◽  
Kneser Graphs

On the neighborhood complex of s→-stable Kneser graphs

2021 ◽  
Vol 344 (4) ◽  
pp. 112302
Author(s):  
Hamid Reza Daneshpajouh ◽  
József Osztényi
Keyword(s):  
Neighborhood Complex ◽  
Kneser Graphs

Kneser Graphs

2001 ◽  
pp. 135-161
Author(s):  
Chris Godsil ◽  
Gordon Royle
Keyword(s):  
Kneser Graphs

scholarly journals A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function

10.37236/8787 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Claude Tardif ◽  
Xuding Zhu
Keyword(s):  
Kneser Graphs ◽  
Hedetniemi’S Conjecture ◽  
Hedetniemi's Conjecture

We prove that $\min\{\chi(G), \chi(H)\} - \chi(G\times H)$ can be arbitrarily large, and that if Stahl's conjecture on the multichromatic number of Kneser graphs holds, then $\min\{\chi(G), \chi(H)\}/\chi(G\times H) \leq 1/2 + \epsilon$ for large values of $\min\{\chi(G), \chi(H)\}$.

scholarly journals Chomp on generalized Kneser graphs and others

2019 ◽  
Author(s):  
Ignacio García-Marco ◽  
Kolja Knauer ◽  
Luis Pedro Montejano
Keyword(s):  
Kneser Graphs

scholarly journals The p-restricted edge-connectivity of Kneser graphs

2019 ◽  
Vol 343 ◽  
pp. 258-267
Author(s):  
C. Balbuena ◽  
X. Marcote
Keyword(s):  
Edge Connectivity ◽  
Kneser Graphs

scholarly journals THE EQUITABLE COLORINGS OF KNESER GRAPHS

2008 ◽  
Vol 12 (4) ◽  
pp. 887-900 ◽  
Author(s):  
Bor-Liang Chen ◽  
Kuo-Ching Huang
Keyword(s):  
Kneser Graphs
Sign in / Sign up

Export Citation Format

Share Document