Discrete Applied Math Seminar By Kevin Milans: Ordered Turan Numbers
Speaker:
Kevin Milans, West Virginia University
Title:
Ordered Turan Numbers
Abstract:
An ordered hypergraph $G$ is a hypergraph whose vertices are linearly ordered. The ordered Turan Number of an $r$-uniform hypergraph $G$ is the maximum number of edges in an $n$-vertex $r$-uniform ordered graph not containing $G$ as an ordered subgraph. We obtain the ordered Turan Numbers of tight $r$-uniform $n$-vertex paths asymptotically when $n \le 2r-1$ and discuss the case of longer tight paths when $r=3$.
This is joint work with Jackson Porter and John Bright.
The Discrete Applied Math seminar will be held most Fridays from 3:30 p.m. - 4:30 p.m. on Zoom during the Spring 2022 semester.
Discrete Applied Math seminar
Event Contact
312.567.3128
kaul@iit.edu