On \(r\)-chromatic hypergraphs (Q658071): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012072955 / 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: Q5724800 / 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: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060863 / 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: Greedy colorings of uniform hypergraphs / 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 proper colourings of hypergraphs using prescribed colours / 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: On the chromatic number of finite systems of subsets / 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

Latest revision as of 20:31, 4 July 2024

scientific article
Language Label Description Also known as
English
On \(r\)-chromatic hypergraphs
scientific article

    Statements

    On \(r\)-chromatic hypergraphs (English)
    0 references
    11 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    hypergraph colorings
    0 references
    maximum edge degree
    0 references
    list colorings
    0 references
    0 references