we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks and prove the theorem by applying induction to cut-contractions with respect to such cuts.
On a conjecture of Graham and Lovász about distance matrices
✍ Scribed by Karen L. Collins
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 513 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu
In 1987, Lova ´sz conjectured that every brick G different from K 4 , C ¯6, and the Petersen graph has an edge e such that G -e is a matching covered graph with exactly one brick. Lova ´sz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and i
## Abstract We present a short proof of factor theorems of Lovász and Tutte.
## Abstract In this paper the conjecture on the __k__th upper multiexponent of primitive matrices proposed by R.A. Brualdi and Liu are completely proved.