Dense uniform hypergraphs have high list chromatic number (Q432708): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexandr V. Kostochka / 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.1016/j.disc.2011.05.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023072337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph list coloring and Euclidean Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice number of random bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On list coloring Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115277 / rank
 
Normal rank

Latest revision as of 11:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Dense uniform hypergraphs have high list chromatic number
scientific article

    Statements

    Dense uniform hypergraphs have high list chromatic number (English)
    0 references
    0 references
    0 references
    4 July 2012
    0 references
    0 references
    list coloring
    0 references
    hypergraph
    0 references
    co-degree
    0 references
    0 references