Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2006.09.024
+Normal rank
@@ Property / OpenAlex ID @@
+W2059144225
@@ Property / OpenAlex ID: W2059144225 / rank @@
+Normal rank
@@ Property / cites work @@
+On extremal problems of graphs and generalized graphs
+Normal rank
@@ Property / cites work @@
+Q5567712
@@ Property / cites work: Q5567712 / 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 @@
+Extremal problems whose solutions are the blowups of the small Witt- designs
+Normal rank
@@ Property / cites work @@
+A note on the jumping constant conjecture of Erdős
+Normal rank
@@ Property / cites work @@
+Hypergraphs do not jump
@@ Property / cites work: Hypergraphs do not jump / rank @@
+Normal rank
@@ Property / cites work @@
+Q5512796
@@ Property / cites work: Q5512796 / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Using Lagrangians of hypergraphs to find non-jumping numbers. I
+Normal rank
@@ Property / cites work @@
+Lagrangians of Hypergraphs
@@ Property / cites work: Lagrangians of Hypergraphs / rank @@
+Normal rank