Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2015.04.017 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2015.04.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517654641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / 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: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring non-uniform hypergraphs without short cycles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2015.04.017 / rank
 
Normal rank

Latest revision as of 03:53, 18 December 2024

scientific article
Language Label Description Also known as
English
Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
scientific article

    Statements

    Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (English)
    0 references
    29 June 2015
    0 references
    colorings of hypergraphs
    0 references
    Erdős-Lovász problem
    0 references
    non-uniform hypergraphs
    0 references
    probabilistic methods
    0 references

    Identifiers