Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dmitriy A. Shabanov / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy A. Shabanov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20366 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134004237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring H-free hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few colors / 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 the chromatic number of set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of sparse uniform hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Erdős and Hajnal in the Case of List Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of finite systems of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of the lower bound in the Erdös-Hajnal combinatorial problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in the combinatorial problem of Erdős and Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:57, 4 July 2024

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

    Statements

    Random coloring method in the combinatorial problem of Erdős and Lovász (English)
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal set theory
    0 references
    simple hypergraphs
    0 references
    chromatic number
    0 references
    maximum vertex degree
    0 references
    0 references