✦ LIBER ✦

Extremal graphs in some coloring problems

✍ Scribed by R. Balakrishnan; R. Sampathkumar; V. Yegnanarayanan

Book ID: 108316193
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 454 KB
Volume: 186
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00216-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some extremal problems on r-graphs

✍ P. Erdös 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The

Some undecidable problems involving the

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

✍ Stefan A. Burr 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o

On some extremal problems in graph theor

On some extremal problems in graph theory

✍ P. Erdös 📂 Article 📅 1965 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 159 KB

On some extremal graphs

✍ U. S. R. Murty 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 311 KB

Extremal problems for directed graphs

✍ W.G Brown; P Erdös; M Simonovits 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Extremal problems concerning Kneser grap

Extremal problems concerning Kneser graphs

✍ P Frankl; Z Füredi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 887 KB