Gábor Lippner

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Maximizing subgraph counts in regular graphs

Gabor Lippner, Arturo Ortiz San Miguel

Given a graph $H$ , we investigate the $d$ -regular graphs $G$ with the highest $H$ -density. We reframe the problem as a continuous optimization problem on the eigenvalues of $G$ by…

math.CO2025

Any fully graphic region of degree sequences can be sampled rapidly

Let $n > c_{1} \geq c_{2}$ and $I^£$ be positive integers with $n \cdot c_{1} \geq I^£ \geq n \cdot c_{2} .$ Let $\mD=\dds{n}Î£{c_1}{c_2}$ denote the set of all degree sequences of length $n$ with the…