Preprint
Sep 2026
A Complete Proof of the Strong Conjecture about $F$-Irregular Graphs
A graph $G$ is called $F$-irregular if all its vertices have distinct $F$-degrees, defined as the number of subgraphs of $G$ isomorphic to a given graph $F$ and containing the respective vertex. We prove the Strong Conjecture about $F$-irregular graphs (Dovzhenok, Filuta, and Chuhai, 2024), which states that for every...
T. Dovzhenok, Artem Filuta
· 1 citation