Lower bounds in the combinatorial problem of Erdős and Lovász (Q606577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An application of Lovász' local lemma-A new lower bound for the van der Waerden number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank

Revision as of 12:18, 3 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds in the combinatorial problem of Erdős and Lovász
scientific article

    Statements

    Lower bounds in the combinatorial problem of Erdős and Lovász (English)
    0 references
    17 November 2010
    0 references
    Szabó's bound
    0 references

    Identifiers