A. Malekshahian

activity

20242026

collaborators

3 papers

math.CO2026

Leaf-to-leaf paths and cycles in degree-critical graphs

Francesco Di Braccio, Kyriakos Katsamaktsis, Jie Ma +2

An $n$ -vertex graph is degree 3-critical if it has $2 n - 2$ edges and no proper induced subgraph with minimum degree at least 3. In 1988, ErdÅs, Faudree, GyÃ¡rfÃ¡s, and Schelp ask…

math.CO2025

Leaf-to-leaf paths of many lengths

Francesco Di Braccio, Kyriakos Katsamaktsis, Alexandru Malekshahian

We prove that every tree of maximum degree $I^$ with $ℓ$ leaves contains paths between leaves of at least $lo g_{I^ - 1} ((I^ - 2) ℓ)$ distinct lengths. This settles in a strong fo…

math.CO2024

The dimension of the feasible region of pattern densities

Frederik Garbe, Daniel Kral, Alexandru Malekshahian +1

A classical result of ErdÅs, LovÃ¡sz and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large grap…