✦ LIBER ✦

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

✍ Scribed by Michael A. Henning; Anders Yeo

Book ID: 112121109
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 745 KB
Volume: 72
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Lower Bounds on the Size of a Maxi

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 106 KB

Forbidden subgraphs and bounds on the si

Forbidden subgraphs and bounds on the size of a maximum matching

✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the

Extending the Balas-Yu bounds on the num

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Leonid Khachiyan 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 191 KB

A Polynomial Lower Bound on the Size of

A Polynomial Lower Bound on the Size of ak-Min-Wise Independent Set of Permutations

✍ S. A. Norin 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 138 KB

On lower bounds on the size of designs i

On lower bounds on the size of designs in compact symmetric spaces of rank 1

✍ Peter Boyvalenkov; Svetla Nikova 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 352 KB

New bounds on the size of the minimum fe

New bounds on the size of the minimum feedback vertex set in meshes and butterflies

✍ Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 113 KB