2 papers
math.CO2025
Density of Traceable Graphs
Michal DvoÅák, DuÅ¡an Knop, Michal Opler +3
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show…
cs.GT2025
Practical approach to -Euclidean Preferences
Michal DvoÅák, DuÅ¡an Knop, Jan Pokorný +1
An election is a pair of candidates and voters. Each vote is a ranking (permutation) of the candidates. An election is -Euclidean if there is an embedding of both candid…