We improve existing lower bounds on the size of maximum edge cuts in cubic graphs with no short cycles. Our method is based on a probabilistic approach.
We improve existing lower bounds on the size of maximum edge cuts in cubic graphs with no short cycles. Our method is based on a probabilistic approach. (en)