Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles (Q6081569): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.23021
@@ Property / DOI: 10.1002/jgt.23021 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4385630062
@@ Property / OpenAlex ID: W4385630062 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305520
@@ Property / cites work: Q4305520 / rank @@
+Normal rank
@@ Property / cites work @@
+Paul turán, 1910–1976: His work in graph theory
+Normal rank
@@ Property / cites work @@
+Method for construction of (3,4)-graphs
@@ Property / cites work: Method for construction of (3,4)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Acquaintances and Strangers at any Party
+Normal rank
@@ Property / cites work @@
+Q4027208
@@ Property / cites work: Q4027208 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5512796
@@ Property / cites work: Q5512796 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
+Normal rank
@@ Property / cites work @@
+On 3-Hypergraphs with Forbidden 4-Vertex Configurations
+Normal rank
@@ Property / cites work @@
+What we know and what we do not know about Turán numbers
+Normal rank
@@ Property / cites work @@
+Q3214957
@@ Property / cites work: Q3214957 / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.23021
@@ Property / DOI: 10.1002/JGT.23021 / rank @@
+Normal rank