✦ LIBER ✦

On the Dinitz conjecture and related conjectures

✍ Scribed by Timothy Y Chow

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 491 KB
Volume: 145
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00055-n

No coin nor oath required. For personal study only.

✦ Synopsis

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. Finally we give an asymptotic result on a related Latin square conjecture.

📜 SIMILAR VOLUMES

New results on the conjecture of Rhodes

New results on the conjecture of Rhodes and on the topological conjecture

✍ S.W. Margolis; J.E. Pin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 543 KB

On the Hughes conjecture

✍ Joseph A Gallian 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 555 KB

On linear differential operators related

On linear differential operators related to the Jacobian conjecture

✍ Yosef Stein 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Some Results Related to the Evasiveness

✍ Frank H. Lutz 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 253 KB

The Evasiveness Conjecture for graph properties has natural generalizations to simplicial complexes and to set systems. In this paper we show that the Evasiveness Conjecture for simplicial complexes holds in dimension 2 and 3. We also present an infinite class of counterexamples to the Generalized A

On the relations of various conjectures

On the relations of various conjectures on Latin squares and straightening coefficients

✍ Rosa Huang; Gian-Carlo Rota 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 620 KB

We begin by discussing Dinitz's conjecture. Recall that a partial Latin square of order n is an n x n array of symbols with the property that no symbol appears more than once in any row or column. While a graduate student at Ohio State University, Jeff Dinitz proposed the following conjecture. Conj

On the critical graph conjecture

✍ Hian Poh Yap 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

## 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