✦ LIBER ✦

The Sylvester–Gallai theorem, colourings and algebra

✍ Scribed by Lou M. Pretorius; Konrad J. Swanepoel

Book ID: 108113978
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 792 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sylvester–Gallai Theorem and Metric Betw

Sylvester–Gallai Theorem and Metric Betweenness

✍ Vasek Chvátal 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 207 KB

On a generalization of the Gallai-Sylves

On a generalization of the Gallai-Sylvester theorem

✍ Yaakov S. Kupitz 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 934 KB

Sylvester–Gallai Theorems for Complex Nu

Sylvester–Gallai Theorems for Complex Numbers and Quaternions

✍ Noam Elkies; Lou M. Pretorius; Konrad J. Swanepoel 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 267 KB

The colour theorems of Brooks and Gallai

The colour theorems of Brooks and Gallai extended

✍ A.V. Kostochka; M. Stiebitz; B. Wirth 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 283 KB

One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension of this result, Gallai [6] characterized the subgraphs of k-colour-c

Fractional matchings and the Edmonds-Gal

Fractional matchings and the Edmonds-Gallai theorem

✍ W.R Pulleyblank 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 542 KB

An algorithmic note on the gallai-milgra

An algorithmic note on the gallai-milgram theorem

✍ Kathie Cameron 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB