Colorings of hypergraphs with large number of colors (Q5895162): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2016.06.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2439149277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark concerning arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on random greedy coloring of uniform 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: Lower bounds for Turán's problem / 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: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for Turán numbers / rank
 
Normal rank

Latest revision as of 11:15, 12 July 2024

scientific article; zbMATH DE number 6617199
Language Label Description Also known as
English
Colorings of hypergraphs with large number of colors
scientific article; zbMATH DE number 6617199

    Statements

    Identifiers