80 citations · 432 across the 27 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.NT2019
Counting bounded elements of a number field
Mikołaj Frączyk, Gergely Harcos, Péter Maga
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obta…
math.CO2019★ 2 cited
New bounds on even cycle creating Hamiltonian paths using expander graphs
Gergely Harcos, Daniel Soltész
We say that two graphs on the same vertex set are -creating if their union (the union of their edges) contains as a subgraph. Let be the maximum number of pairwise…