/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
The minimum complement-edge neighborhood-union order, when a complement edge exists.
All goals completed! 🐙⟩e)|>.min
The universal inequality proposed in WOWII Conjecture 309. The Option-valued
minimum makes the statement vacuous for complete graphs, whose complements
have no edge; this totalization does not affect the counterexample.
Does every finite simple connected graph $G$ of order greater than two satisfy
$$
\gamma_t(G) \leq \frac{1}{2}\left(
\max_v(\operatorname{distEven}(v)-\operatorname{evenHorizontal}(v))+
\min_{e\in E(\overline G)}|N_{\overline G}(e)|\right)?
$$
Gebendorfer disproved the statement with the family $C_5[K_k]$, $k \geq 3$.