✦ LIBER ✦

On induced acyclic subgraphs in sparse random digraphs

✍ Scribed by Kunal Dutta; C.R. Subramanian

Book ID: 119236574
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 181 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.09.052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orders of Induced Subgraphs in Sparse Ra

Orders of Induced Subgraphs in Sparse Random Graphs

✍ ZBIGNIEW PALKA 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

On small subgraphs in a random intersect

On small subgraphs in a random intersection digraph

✍ Kurauskas, Valentas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Longest cycles in sparse random digraphs

✍ Michael Krivelevich; Eyal Lubetzky; Benny Sudakov 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

Induced subgraphs in sparse random graph

Induced subgraphs in sparse random graphs with given degree sequences

✍ Pu Gao; Yi Su; Nicholas Wormald 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Sparse regular induced subgraphs in -fre

Sparse regular induced subgraphs in -free graphs

✍ Lozin, Vadim V.; Mosca, Raffaele; Purcell, Christopher 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 363 KB

One-diregular subgraphs in semicomplete

One-diregular subgraphs in semicomplete multipartite digraphs

✍ Yeo, Anders 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraph (SMD) to be Hamiltonian, seems to be both very interesting and difficult. Bang-Jensen, Gutin and Huang (Discrete Math to appear) proved a sufficient condition for a SMD to be Hamiltonian. A strengtheni