Benny Sudakov

activity

20102026

most citedApproximate path decompositions of regular graphs

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

Restricted subgraphs of edge-colored graphs and applications

Benny Sudakov

A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all it…

math.CO2024★ 1 cited

Approximate path decompositions of regular graphs

Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy +1

We show that the edges of any $d$ -regular graph can be almost decomposed into paths of length roughly $d$ , giving an approximate solution to a problem of Kotzig from 1957. Along th…

math.CO2024★ 1 cited

Hamiltonicity of expanders: optimal bounds and applications

Nemanja Draganić, Richard Montgomery, David Munhá Correia +2

An $n$ -vertex graph $G$ is a $C$ -expander if $∣ N (X) ∣ \geq C ∣ X ∣$ for every $X \subseteq V (G)$ with $∣ X ∣ < n /2 C$ and there is an edge between every two disjoint sets of at least $n /2 C$ …