Coloring H-free hypergraphs (Q3055875): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with sparse neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring triangle-free graphs with fixed size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Brooks' Theorem for Sparse Graphs / 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: Bounding Ramsey numbers through large deviation inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on embedding hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank

Revision as of 10:37, 3 July 2024

scientific article
Language Label Description Also known as
English
Coloring H-free hypergraphs
scientific article

    Statements

    Identifiers