𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arrangements of lines and pseudolines without adjacent triangles

✍ Scribed by Dragoslav Ljubić; Jean-Pierre Roudneff; Bernd Sturmfels

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
421 KB
Volume
50
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangles in arrangements of lines
Triangles in arrangements of lines
✍ G.B. Purdy 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 486 KB

A set of n nonconcurrent lines in the projective plane (called an arrangement) divides the plane into polygonal cells. It has long been a problem to find a nontrivial upper bound on the number of triangular regions. We show that &n(n -1) is such a bound. We also show that if no three lines are concu

Structural properties of plane graphs wi
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
✍ O. V. Borodin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 1 views

If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw

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