Asymptotically Almost Every 2r-regular Graph has an Internal Partition
classification
🧮 math.CO
keywords
everygraphinternalpartitionalmostasymptoticallyregularvertex
read the original abstract
An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every $2r$-regular graph has an internal partition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.