Toughness and triangle-free graphs (Q1907099)

From MaRDI portal
Revision as of 01:27, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Toughness and triangle-free graphs
scientific article

    Statements

    Toughness and triangle-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 January 1996
    0 references
    We prove that there exist triangle-free graphs with arbitrarily large toughness, thereby settling a longstanding open question. We also explore the problem of whether there exists a \(t\)-tough, \(n/(t + 1)\)-regular, triangle-free graph on \(n\) vertices for various values of \(t\), and provide a relatively complete answer for small values of \(t\).
    0 references
    \(t\)-tough
    0 references
    toughness
    0 references
    triangle-free graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references