✦ LIBER ✦

Endpoint extendable paths in dense graphs

✍ Scribed by Guantao Chen; Zhiquan Hu; Hao Li

Book ID: 113567449
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 266 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.09.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Endpoint extendable paths in tournaments

✍ Faudree, Ralph J.; Gy�rf�s, Andr�s 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

Let s(n) be the threshold for which each directed path of order smaller than s ( n ) is extendible from one of its endpoints in some tournament T,. It is shown that s(n) is asymptotic to 3n/4, with an error term at most 3 for infinitely many n. There are six tournaments with s ( n ) = n.

Path extendable graphs

✍ G. R. T. Hendry 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 666 KB

On sparse graphs with dense long paths

✍ P. Erdös; R.L. Graham; E. Szemerédi 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Approximately Counting Hamilton Paths an

Approximately Counting Hamilton Paths and Cycles in Dense Graphs

✍ Dyer, Martin; Frieze, Alan; Jerrum, Mark 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 265 KB

Rainbow k-connection in Dense Graphs (Ex

Rainbow k-connection in Dense Graphs (Extended Abstract)

✍ Shinya Fujita; Henry Liu; Colton Magnant 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Independence number in n-extendable grap

Independence number in n-extendable graphs

✍ Peter Maschlanka; Lutz Volkmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Let G be a connected graph with p vertices and n a positive integer with 1 dn <(p/2) -1. G is said to be O-extendable if G has a perfect matching. G is said to be n-extendable if G has a matching of size n and every matching of size n in G extends to (i.e. is a subset of) a perfect matching. It is s