CLaN Research Group | CLaN
Seminar | WSU Colloquium | Department Home

Washington State University

Combinatorics, Linear Algebra and Number Theory (CLaN) Seminar

Department of Mathematics and Statistics

Neill Hall 5W

September 10, Monday, 4:10 - 5:00 PM

Jordan Miller

Department of Mathematics and Statistics

Washington State University

Combinatorics, Linear Algebra and Number Theory (CLaN) Seminar

Department of Mathematics and Statistics

Neill Hall 5W

September 10, Monday, 4:10 - 5:00 PM

Jordan Miller

Department of Mathematics and Statistics

Washington State University

Title: Intersections and Faces of Line Segment Graphs

Abstract: We can derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We will consider sets of segments whose underlying planar graphs are Halin graphs, cactus graphs, maximal planar graphs, and triangle-free planar graphs.

Abstract: We can derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We will consider sets of segments whose underlying planar graphs are Halin graphs, cactus graphs, maximal planar graphs, and triangle-free planar graphs.