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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(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 / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1064562410020341 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051963929 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:52, 30 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

    Identifiers