✦ LIBER ✦

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

✍ Scribed by Deepak Bal; Andrzej Dudek; Zelealem B. Yilma

Book ID: 113567385
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 193 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.07.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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~[

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

On maximum number of edges in a spanning

On maximum number of edges in a spanning eulerian subgraph

✍ Dengxin Li; Deying Li; Jingzhong Mao 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 168 KB

The maximum number of edges in a graph w

The maximum number of edges in a graph with fixed edge-degree

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

Upper bound of the number of edges of a

Upper bound of the number of edges of a homogeneous connected hypergraph with a given diameter

✍ O. G. Rudenskaya 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 122 KB

The number of perfect matchings in a hyp

The number of perfect matchings in a hypercube

✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff