On the maximum size of connected hypergraphs without a path of given length (Q724883): Difference between revisions

@@ Property / cites work @@
+Connected graphs without long paths
@@ Property / cites work: Connected graphs without long paths / rank @@
+Normal rank
@@ Property / cites work @@
+An Erdős-Gallai type theorem for uniform hypergraphs
+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 @@
+Hypergraph extensions of the Erdős-Gallai theorem
+Normal rank
@@ Property / cites work @@
+Q3852213
@@ Property / cites work: Q3852213 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of cliques in graphs without long cycles
+Normal rank