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

@@ Property / DOI @@
-.1016/j.disc.2011.10.008
@@ Property / DOI: 10.1016/j.disc.2011.10.008 / rank @@
-Normal rank
@@ Property / author @@
+Dmitriy A. Shabanov
@@ Property / author: Dmitriy A. Shabanov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2011.10.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2012072955
@@ Property / OpenAlex ID: W2012072955 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraphs with high chromatic number
@@ Property / cites work: Hypergraphs with high chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+On 3-chromatic hypergraphs
@@ Property / cites work: On 3-chromatic hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring H-free hypergraphs
@@ Property / cites work: Coloring H-free hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5724800
@@ Property / cites work: Q5724800 / rank @@
+Normal rank
@@ Property / cites work @@
+On a combinatorial problem. II
@@ Property / cites work: On a combinatorial problem. II / rank @@
+Normal rank
@@ Property / cites work @@
+On a property of families of sets
@@ Property / cites work: On a property of families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074927
@@ Property / cites work: Q4074927 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring uniform hypergraphs with few colors
@@ Property / cites work: Coloring uniform hypergraphs with few colors / rank @@
+Normal rank
@@ Property / cites work @@
+Q5477816
@@ Property / cites work: Q5477816 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring uniform hypergraphs with few edges
@@ Property / cites work: Coloring uniform hypergraphs with few edges / rank @@
+Normal rank
@@ Property / cites work @@
+Q3060863
@@ Property / cites work: Q3060863 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of set systems
@@ Property / cites work: On the chromatic number of set systems / rank @@
+Normal rank
@@ Property / cites work @@
+Constructions of sparse uniform hypergraphs with high chromatic number
+Normal rank
@@ Property / cites work @@
+Greedy colorings of uniform hypergraphs
@@ Property / cites work: Greedy colorings of uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds and algorithms for hypergraph 2-coloring
+Normal rank
@@ Property / cites work @@
+On proper colourings of hypergraphs using prescribed colours
+Normal rank
@@ Property / cites work @@
+Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
+Normal rank
@@ Property / cites work @@
+On the chromatic number of finite systems of subsets
+Normal rank
@@ Property / cites work @@
+Lower bounds in the combinatorial problem of Erdős and Lovász
+Normal rank
@@ Property / cites work @@
+Coloring n-sets red and blue
@@ Property / cites work: Coloring n-sets red and blue / rank @@
+Normal rank
@@ Property / cites work @@
+An application of Lovász' local lemma-A new lower bound for the van der Waerden number
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2011.10.008
@@ Property / DOI: 10.1016/J.DISC.2011.10.008 / rank @@
+Normal rank