/-
Copyright 2025 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.
-/
import FormalConjecturesUtilWritten on the Wall II - Conjecture 200
namespace WrittenOnTheWallII.GraphConjecture200
open Classical SimpleGraph
variable {α : Type*} [Fintype α] [DecidableEq α] [Nontrivial α]
WOWII Conjecture 200
For a simple connected graph G, if tree(G) = ⌈1 + l_avg(G)⌉, then G has a Hamiltonian path.
Here tree(G) is the number of vertices of a largest induced tree subgraph, and
l_avg(G) = averageIndepNeighbors G is the average over all vertices of the independence number
of the neighbourhood.
A Hamiltonian path is a walk visiting every vertex exactly once.
@[category research open, AMS 5]
theorem conjecture200 (G : SimpleGraph α) (h : G.Connected)
(htree : (largestInducedTreeSize G : ℝ) = ⌈1 + averageIndepNeighbors G⌉) :
∃ a b : α, ∃ p : G.Walk a b, p.IsHamiltonian := α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph αh:G.Connectedhtree:↑G.largestInducedTreeSize = ↑⌈1 + G.averageIndepNeighbors⌉⊢ ∃ a b p, p.IsHamiltonian
All goals completed! 🐙
-- Sanity checks
/-- The `largestInducedTreeSize` is nonneg. -/
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ largestInducedTreeSize G := Nat.zero_le _
/-- The average indep-neighbors is nonneg. -/
@[category test, AMS 5]
example (G : SimpleGraph (Fin 3)) : 0 ≤ averageIndepNeighbors G := α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ G.averageIndepNeighbors
α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ (∑ v, G.indepNeighbors v) / ↑(Fintype.card (Fin 3))
α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ ∑ v, G.indepNeighbors vα:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ ↑(Fintype.card (Fin 3))
α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ ∑ v, G.indepNeighbors v α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ ∀ i ∈ Finset.univ, 0 ≤ G.indepNeighbors i; intro v α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)v:Fin 3a✝:v ∈ Finset.univ⊢ 0 ≤ G.indepNeighbors v; All goals completed! 🐙
α:Type u_1inst✝²:Fintype αinst✝¹:DecidableEq αinst✝:Nontrivial αG:SimpleGraph (Fin 3)⊢ 0 ≤ ↑(Fintype.card (Fin 3)) All goals completed! 🐙
end WrittenOnTheWallII.GraphConjecture200