A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C07
@@ Property / Mathematics Subject Classification ID: 05C07 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5912874
@@ Property / zbMATH DE Number: 5912874 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Erdős-sós conjecture
@@ Property / zbMATH Keywords: Erdős-sós conjecture / rank @@
+Normal rank
@@ 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.1007/s10114-011-9617-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2061942211
@@ Property / OpenAlex ID: W2061942211 / 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 @@
+On the Erd�s-S�s conjecture
@@ Property / cites work: On the Erd�s-S�s conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138754
@@ Property / cites work: Q3138754 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic solution for a new class of forbidden r-graphs
+Normal rank
@@ Property / cites work @@
+Q3114975
@@ Property / cites work: Q3114975 / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Sós conjecture for spiders
@@ Property / cites work: The Erdős-Sós conjecture for spiders / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős‐Sós Conjecture for trees of diameter four
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220603
@@ Property / cites work: Q3220603 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing a tree with a graph of the same size
@@ Property / cites work: Packing a tree with a graph of the same size / rank @@
+Normal rank
@@ Property / cites work @@
+Q3114952
@@ Property / cites work: Q3114952 / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdös-Sós conjecture for graphs of girth 5
@@ Property / cites work: The Erdös-Sós conjecture for graphs of girth 5 / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdös-Sós conjecture for graphs without \(C_ 4\)
+Normal rank
@@ Property / cites work @@
+The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
+Normal rank
@@ Property / cites work @@
+Tree embeddings
@@ Property / cites work: Tree embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing Trees in Graphs whose Complement  has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub>
+Normal rank
@@ Property / cites work @@
+A variation of a conjecture due to Erdös and Sós
+Normal rank
@@ Property / cites work @@
+Q3158579
@@ Property / cites work: Q3158579 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:546277