✦ LIBER ✦

An Extremal Result for Paths

✍ Scribed by PAUL ERDÖS; R. J. FAUDREE; R. H. SCHELP; M. SIMONOVITS

Book ID: 119862762
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 355 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16394.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An edge extremal result for subcohesion

✍ F.T Boesch; J.A.M McHugh 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 345 KB

An extremal result for divisor functions

✍ R.A MacLeod 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 59 KB

An extremal result for sum-free sequence

An extremal result for sum-free sequences

✍ Eugene Levine 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 237 KB

An extremal problem for paths in biparti

An extremal problem for paths in bipartite graphs

✍ A. Gyárfás; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

An Extremal Result for Subgraphs with Fe

An Extremal Result for Subgraphs with Few Edges

✍ S. Brandt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

We prove that whenever the edge number of a graph of order \(n \geqslant 517\) ensures that it contains every complete graph and every forest with at most \(n\) vertices and at most \(m\) edges, then the graph contains every graph with at most \(n\) vertices and \(m\) edges if \(m<n\). The required

An extremal result on convex lattice pol

An extremal result on convex lattice polygons

✍ Eberth Alarcon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 329 KB