✦ LIBER ✦

Lower bounds for the size in four families of minimum broadcast graphs

✍ Scribed by J.-F. Saclé

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 469 KB
Volume: 150
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00200-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds for the size of edge ch

New lower bounds for the size of edge chromatic critical graphs

✍ Yue Zhao 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004

A superlinear lower bound for the size o

A superlinear lower bound for the size of a critical set in a latin square

✍ Nicholas J. Cavenagh 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let __scs__(__n__) denote the smallest possible size of a critical set in a latin square of order __n__. We show that for all __n__, $scs(n)\geq n\lfloo