Sparse halves in triangle-free graphs (Q2496210): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2005.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2118502851
@@ Property / OpenAlex ID: W2118502851 / rank @@
+Normal rank
@@ Property / cites work @@
+On the connection between chromatic number, maximal clique and minimal degree of a graph
+Normal rank
@@ Property / cites work @@
+Q4101818
@@ Property / cites work: Q4101818 / rank @@
+Normal rank
@@ Property / cites work @@
+Some old and new problems in various branches of combinatorics
+Normal rank
@@ Property / cites work @@
+How to make a graph bipartite
@@ Property / cites work: How to make a graph bipartite / rank @@
+Normal rank
@@ Property / cites work @@
+A local density condition for triangles
@@ Property / cites work: A local density condition for triangles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137183
@@ Property / cites work: Q3137183 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Density in Graphs with Forbidden Subgraphs
@@ Property / cites work: Local Density in Graphs with Forbidden Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the edge distribution in triangle-free graphs
@@ Property / cites work: On the edge distribution in triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Making a \(K_4\)-free graph bipartite
@@ Property / cites work: Making a \(K_4\)-free graph bipartite / rank @@
+Normal rank