Turán's theorem inverted (Q1045153): Difference between revisions

@@ Property / cites work @@
+On the connection between chromatic number, maximal clique and minimal degree of a graph
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Joints in graphs
@@ Property / cites work: Joints in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of linear graphs
@@ Property / cites work: On the structure of linear graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5544083
@@ Property / cites work: Q5544083 / rank @@
+Normal rank
@@ Property / cites work @@
+On a valence problem in extremal graph theory
@@ Property / cites work: On a valence problem in extremal graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with many <i>r</i> -cliques have large complete <i>r</i> -partite subgraphs
+Normal rank
@@ Property / cites work @@
+Graphs with many copies of a given subgraph
@@ Property / cites work: Graphs with many copies of a given subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Complete \(r\)-partite subgraphs of dense \(r\)-graphs
+Normal rank
@@ Property / cites work @@
+Q5548826
@@ Property / cites work: Q5548826 / rank @@
+Normal rank