15 citations · 42 across the 7 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
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…