𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Entropy bounds for perfect matchings and Hamiltonian cycles

✍ Scribed by Bill Cuckler; Jeff Kahn

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
432 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Forbidden triples for perfect matchings
Forbidden triples for perfect matchings
✍ Katsuhiro Ota; Michael D. Plummer;; Akira Saito πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H| ≀ 2 such that every connected H

Random Matchings Which Induce Hamilton C
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs
✍ Jeong Han Kim; Nicholas C. Wormald πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 215 KB

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set

New bounds on nearly perfect matchings i
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
✍ Van H. Vu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 253 KB

Let H be a k + 1 -uniform, D-regular hypergraph on n vertices and let H be the minimum number of vertices left uncovered by a matching in H. C j H , the j-codegree of H, is the maximum number of edges sharing a set of j vertices in common. We prove a general upper bound on H , based on the codegree