𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Empty triangles in drawings of the complete graph

✍ Scribed by Heiko Harborth

Book ID
108316263
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
113 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Triangles in a complete chromatic graph
Triangles in a complete chromatic graph with three colors
✍ A.W Goodman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for

Edge colorings of complete graphs withou
Edge colorings of complete graphs without tricolored triangles
✍ AndrΓ‘s GyΓ‘rfΓ‘s; GΓ‘bor Simony πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 59 KB

## Abstract We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size

Decompositions of complete graphs into t
Decompositions of complete graphs into triangles and Hamilton cycles
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 121 KB πŸ‘ 1 views

## Abstract For all odd integers __n__ β‰₯ 1, let __G~n~__ denote the complete graph of order __n__, and for all even integers __n__ β‰₯ 2 let __G~n~__ denote the complete graph of order __n__ with the edges of a 1‐factor removed. It is shown that for all non‐negative integers __h__ and __t__ and all p