15 citations · 42 across the 7 of their papers we have counts for
9 papers
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…
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…
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…
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…
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…
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…
On the rank of higher inclusion matrices
Codrut Grosu, Yury Person, Tibor Szabo
Let r >= s >= 0 be integers and G be an r-graph. The higher inclusion matrix M_s^r(G) is a {0,1}-matrix with rows indexed by the edges of G and columns indexed by the subsets of V(…
F_p is locally like C
Codrut Grosu
Vu, Wood and Wood showed that any finite set S in a characteristic zero integral domain can be mapped to F_p, for infinitely many primes p, while preserving finitely many algebraic…
The extremal function for partial bipartite tilings
Codrut Grosu, Jan Hladky
For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains $(…