Showing math.COShow all
2 papers · 1 filter
math.CO2026
Totally Disjoint Diametral Paths
Tınaz Ekim, Arthur Farley
In this paper, we study totally disjoint diametral paths in simple connected graphs. A diametral path in a graph is a shortest path that connects two vertices whose mutual distance…
math.CO2025
Sparse Sets in Triangle-free Graphs
Tınaz Ekim, Burak Nur Erdem, John Gimbel
A set of vertices is -sparse if it induces a graph with a maximum degree of at most . In this missive, we consider the order of the largest -sparse set in a triangle-free…