The codiameter of a graph is the largest integer $k$ such that for any pair of vertices $x$ and $y$, there exists an $x,y$-path of length at least k. Extremal problems on the codiameter of graphs, especially for the case k=n-1 (Hamiltonian-connected graphs), have been well studied. We consider an analogous problem for hypergraphs in which every pair of vertices is connected by a long Berge path.
The codiameter of hypergraphs
Ruth Luo, University of South CarolinaAuthors: Alexandr Kostochka, Ruth Luo, Grace McCourt
2023 AWM Research Symposium
Extremal and Probabilistic Combinatorics [Organized by Jinyoung Park and Corrine Yap]