3 papers
math.CO2026
The least balanced graphs and trees
Péter Csikvári, Viktor Harangi
Given a connected graph, the principal eigenvector of the adjacency matrix (often called the Perron vector) can be used to assign positive weights to the vertices. A natural way to…
math.CO2025
Star decompositions via orientations
Viktor Harangi
A -star decomposition of a graph is a partition of its edges into -stars (i.e., edges with a common vertex). The paper studies the following problem: given ,…
math.CO2025
Star decompositions and independent sets in random regular graphs
Viktor Harangi
A -star decomposition of a graph is a partition of its edges into -stars (i.e., edges with a common vertex). The paper studies the following problem: for what values of $…