The shifting method and generalized Turán number of matchings (Q2297913): Difference between revisions

@@ Property / cites work @@
+On the size of graphs with complete-factors
@@ Property / cites work: On the size of graphs with complete-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Many \(T\) copies in \(H\)-free graphs
@@ Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Turán problems for disjoint copies of graphs
+Normal rank
@@ Property / cites work @@
+Counting copies of a fixed subgraph in \(F\)-free graphs
+Normal rank
@@ Property / cites work @@
+A generalized Turán problem and its applications
@@ Property / cites work: A generalized Turán problem and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of five-cycles in a triangle-free graph
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of cliques in graphs without long cycles
+Normal rank
@@ Property / cites work @@
+Some sharp results on the generalized Turán numbers
+Normal rank
@@ Property / cites work @@
+Q5790850
@@ Property / cites work: Q5790850 / rank @@
+Normal rank