activity
20092026
most citedAlmost all trees are almost graceful

8 citations · 10 across the 3 of their papers we have counts for

collaborators

9 papers

cs.AI2026★ 2 cited

Advancing Mathematics Research with AI-Driven Formal Proof Search

George Tsoukalas, Anton Kovsharov, Sergey Shirobokov +18

Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research. A mitigation is using LLMs to gener…

math.CO2016★ 8 cited

Almost all trees are almost graceful

Anna Adamaszek, Peter Allen, Codrut Grosu +1

The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that t…

math.CO2016

On spanning trees with high internal degree

Codrut Grosu

Alon and Wormald showed that any graph with minimum degree d contains a spanning star forest in which every connected component is of size at least Ω((d/\log d)^{1/3}). They asked…

math.CO2016

A note on projective norm graphs

Codrut Grosu

The projective norm graphs P(q, 4) introduced by Alon, Rónyai and Szabó are explicit examples of extremal graphs not containing K_4,7. Ball and Pepe showed that P(q, 4) does not co…

math.CO2015

A new lower bound for the Towers of Hanoi problem

Codrut Grosu

More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry Bousch in a breakthrough paper in 2014. The general problem with p pegs is stil…

math.CO2014

On the algebraic and topological structure of the set of Turán densities

Codrut Grosu

The present paper is concerned with the various algebraic structures supported by the set of Turán densities. We prove that the set of Turán densities of finite families of r-graph…