Coloring uniform hypergraphs with few edges (Q3055779): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q312270
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.1002/rsa.20284 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4236390637 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q85548126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark concerning arithmetic progressions / rank
 
Normal rank

Latest revision as of 11:34, 3 July 2024

scientific article
Language Label Description Also known as
English
Coloring uniform hypergraphs with few edges
scientific article

    Statements

    Coloring uniform hypergraphs with few edges (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2010
    0 references
    0 references
    hypergraph coloring
    0 references
    maximum degree
    0 references
    edge-degree
    0 references
    small size
    0 references
    0 references
    0 references