✦ LIBER ✦

Small topological complete subgraphs of “dense” graphs

✍ Scribed by A. Kostochka; L. Pyber

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 153 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122555

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering a graph by topological complete

Covering a graph by topological complete subgraphs

✍ L. K. Jørgensen; L. Pyber 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 742 KB

Topological Subgraphs in Graphs of Large

Topological Subgraphs in Graphs of Large Girth

✍ W. Mader 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 182 KB

On complete subgraphs of color-critical

On complete subgraphs of color-critical graphs

✍ Xiang-Ying Su 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A graph G is called k-critical if x(G) = k and x(G -e) -C x(G) for each edge e of G, where x denotes the chromatic number. T. Gallai conjectured that every k-critical graph of order n contains at most n complete (kl)-subgraphs. In 1987, Stiebitz proved Gallai's conjecture in the case k = 4, and in 1

On complete subgraphs of r-chromatic gra

On complete subgraphs of r-chromatic graphs

✍ B. Bollobás; P. Erdös; E. Szemerédi 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 518 KB

2-Colorings of complete graphs with a sm

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

✍ F. Franek; V. Rödl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Complete subgraphs of the graphs of conv

Complete subgraphs of the graphs of convex polytopes

✍ S. Gallivan; E.R. Lockeberg; P. McMullen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 631 KB

It is shown that if three vertices of the graph c?(l)) of a convex 3-polytope P are chosen, then G(P) contains a refinement of the complete graph C,, on four vertices, for which the three chosen vertices are principal (that is, correspond to vertices of C, in the refinement.. In general, all four ve