The Ramsey numbers of large cycles versus odd wheels (Q2482346): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly pancyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Ramsey theory for graphs. III: Small off-diagonal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for graphs with five vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ramsey numbers for trees versus wheels of five or six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey numbers of large cycles versus wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367971 / rank
 
Normal rank

Latest revision as of 20:39, 27 June 2024

scientific article
Language Label Description Also known as
English
The Ramsey numbers of large cycles versus odd wheels
scientific article

    Statements

    The Ramsey numbers of large cycles versus odd wheels (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    It is shown that the Ramsey number \(R(C_n, W_m) = 3n - 2\) for odd \(m \geq 5\) and \(n > (5m - 9)/2\), where \(W_m\) is the the wheel on \(m + 1\) vertices. This gives another class of pairs of graphs \((G, H)\) that satisfy the condition that \(R(G, H) = (\chi(H) - 1)(| G| - 1) + 1\) that comes from the canonical edge coloring. The paper ends with a reasonable conjecture consistent with the canonical coloring that \(R(C_n, W_m) = 3n - 2\) when \(m\) is odd and \(n \geq m \geq 3\) with \((n, m) \neq (3,3)\) and \(R(C_n, W_m) = 2n - 1\) when \(m\) is even and \(n \geq m \geq 4\) with \((n, m) \neq (4,4)\).
    0 references
    Ramsey numbers
    0 references
    wheels
    0 references
    cycles
    0 references

    Identifiers