Lower bounds in the combinatorial problem of Erdős and Lovász (Q606577): Difference between revisions

@@ 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 / cites work @@
+An application of Lovász' local lemma-A new lower bound for the van der Waerden number
+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 @@
+Coloring uniform hypergraphs with few edges
@@ Property / cites work: Coloring uniform hypergraphs with few edges / rank @@
+Normal rank
@@ Property / cites work @@
+On 3-chromatic hypergraphs
@@ Property / cites work: On 3-chromatic hypergraphs / rank @@
+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 @@
+Improved bounds and algorithms for hypergraph 2-coloring
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064562410020341
+Normal rank
@@ Property / OpenAlex ID @@
+W2051963929
@@ Property / OpenAlex ID: W2051963929 / rank @@
+Normal rank