✦ LIBER ✦

On the expected number of edges in a maximum matching of an (r,s)-tree

✍ Scribed by Cho, J. H.; Palmer, E. M.

Book ID: 126704916
Publisher: Taylor and Francis Group
Year: 1995
Tongue: English
Weight: 462 KB
Volume: 56
Category: Article
ISSN: 0020-7160
DOI: 10.1080/00207169508804386

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of maximum matchings in a tre

The number of maximum matchings in a tree

✍ Clemens Heuberger; Stephan Wagner 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 700 KB

On the maximum number of edges in a hype

On the maximum number of edges in a hypergraph with a unique perfect matching

✍ Deepak Bal; Andrzej Dudek; Zelealem B. Yilma 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

On the maximum number of edges in a c4-f

On the maximum number of edges in a c4-free subgraph of qn

✍ Peter Brass; Heiko Harborth; Hauke Nienborg 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB 👁 2 views

For the maximum number f ( n ) of edges in a C4-free subgraph of the n-dimensional cube-graph 0, w e prove f(n) 2 i ( n + f i ) 2 " -' for n = 4f, and f ( n ) 2 i ( n + 0.9,h)2"-' for all n 2 9. This disproves one version of a conjecture of P. Erdos.

On the maximum number of edges in a hype

On the maximum number of edges in a hypergraph whose linegraph contains no cycle

✍ J.-C. Bermond; P. Frankl; F. Sterboul 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Soit H = (X. ~1 un hypergraphe h-uniforme avec IX] = net soit L h ~(H! le graphe Jont les sommets reprdsentent les arates de H, deux sommets 6lant reli6s si et seulement si t~s z~r6tes qu'ils reprdsen!ent intersectent en h -1 sommet,=. Nous montrons que sif,, t(H) ne contienl pas de cycle, alors I~[

The maximum number of edges in a 3-graph

The maximum number of edges in a 3-graph not containing a given star

✍ F. R. K. Chung; P. Frankl 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 876 KB

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it