Sparse hypergraphs with low independence number (Q1705800): Difference between revisions

@@ Property / OpenAlex ID @@
+W2181370180
@@ Property / OpenAlex ID: W2181370180 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0813
@@ Property / arXiv ID: 1312.0813 / rank @@
+Normal rank
@@ Property / cites work @@
+On Turan's theorem for sparse graphs
@@ Property / cites work: On Turan's theorem for sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal uncrowded hypergraphs
@@ Property / cites work: Extremal uncrowded hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A dense infinite Sidon sequence
@@ Property / cites work: A dense infinite Sidon sequence / rank @@
+Normal rank
@@ Property / cites work @@
+Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
+Normal rank
@@ Property / cites work @@
+Coloring H-free hypergraphs
@@ Property / cites work: Coloring H-free hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring triangle-free hypergraphs
@@ Property / cites work: List coloring triangle-free hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of simple triangle-free triple systems
+Normal rank
@@ Property / cites work @@
+A Lower Bound for Heilbronn'S Problem
@@ Property / cites work: A Lower Bound for Heilbronn'S Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Parity-Check Matrices over                       ${GF(q)}$
@@ Property / cites work: Sparse Parity-Check Matrices over ${GF(q)}$ / rank @@
+Normal rank
@@ Property / cites work @@
+An intersection theorem for four sets
@@ Property / cites work: An intersection theorem for four sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3027024
@@ Property / cites work: Q3027024 / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of sparse graphs
@@ Property / cites work: On the independence number of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Turan's theorem for \(k\)-graphs
@@ Property / cites work: Turan's theorem for \(k\)-graphs / rank @@
+Normal rank