The toughness of Kneser graphs (Q2037560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tough Ramsey graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and spectrum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum and toughness of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-chromatically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Short Proof of Kneser's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral approach to bandwidth and separator problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank

Latest revision as of 04:53, 26 July 2024

scientific article
Language Label Description Also known as
English
The toughness of Kneser graphs
scientific article

    Statements

    The toughness of Kneser graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    Kneser graph
    0 references
    graph connectivity
    0 references
    toughness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references