We present previously unpublished elementary proofs by Dekker and Ottens (1991) and Boyce (private communication) of a special case of the Dinitz conjecture. We prove a special case of a related basis conjecture by Rota, and give a reformulation of Rota's conjecture using the Nullstellensatz. Finall
On the Hughes conjecture
✍ Scribed by Joseph A Gallian
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 555 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract C. Thomassen proposed a conjecture: Let __G__ be a __k__‐connected graph with the stability number α ≥ __k__, then __G__ has a cycle __C__ containing __k__ independent vertices and all their neighbors. In this paper, we will obtain the following result: Let __G__ be a __k__‐connected gr
## Abstract Gol'dberg has recently constructed an infinite family of 3‐critical graphs of even order. We now prove that if there exists a __p__(≥4)‐critical graph __K__ of odd order such that __K__ has a vertex __u__ of valency 2 and another vertex __v__ ≠ __u__ of valency ≤(__p__ + 2)/2, then ther
## Abstract It is proved that a simple 4‐regular graph without __K__~1,3~ as an induced subgraph has a 3‐regular subgraph.
If f 1 ðnÞ; . . . ; f r ðnÞ are all prime for infinitely many n; then it is necessary that the polynomials f i are irreducible in Z½X ; have positive leading coefficients, and no prime p divides all values of the product f 1 ðnÞ Á Á Á f r ðnÞ; as n runs over Z: Assuming these necessary conditions, B