A. Davoodi

activity

20122026

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 40 across the 8 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Clique Coverings and Claw-free Graphs

Csilla Bujtás, Akbar Davoodi, Ervin Győri +1

Let $C$ be a clique covering for $E (G)$ and let $v$ be a vertex of $G$ . The valency of vertex $v$ (with respect to $C$ ), denoted by $v a l_{C} (v)$ , is the number of cl…

math.CO2016★ 39 cited

An Erdős-Gallai type theorem for uniform hypergraphs

Akbar Davoodi, Ervin Győri, Abhishek Methuku +1

A well-known theorem of Erdős and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2} (k - 1) n$ edges. Recently Győri, Katona and Lemons gave an exten…