A complete characterization of the zero-sum (mod 2) Ramsey numbers (Q1336447): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On three zero‐sum Ramsey‐type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems with no union of cardinality 0 modulo \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero sum Ramsey numbers: Multiple copies of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-sum Ramsey numbers--stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several variations of the turan and ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero‐sum delta‐systems and multiple copies of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-sum problems -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4015311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colored complete graphs with precisely colored subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler proof and a generalization of the zero-trees theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360883 / rank
 
Normal rank

Latest revision as of 09:58, 23 May 2024

scientific article
Language Label Description Also known as
English
A complete characterization of the zero-sum (mod 2) Ramsey numbers
scientific article

    Statements

    A complete characterization of the zero-sum (mod 2) Ramsey numbers (English)
    0 references
    0 references
    22 November 1994
    0 references
    The zero-sum (mod 2) Ramsey number of a graph \(G\) is the smallest integer \(t\) such that in every edge coloring of the complete graph on \(t\) vertices with colors zero and one, there is a copy of \(G\) containing an even number of ones. The author determines zero-sum Ramsey numbers for all graphs with an even number of edges. Suppose that \(G\) is such a graph of order \(n\). Then the zero-sum Ramsey number is \(n+2\) if \(G\) is complete; \(n+1\) if \(G\) is the union of two complete graphs or if all degrees in \(G\) are odd; \(n\) otherwise.
    0 references
    0 references
    zero-sum Ramsey numbers
    0 references
    0 references