Submitted:
17 August 2026
Posted:
19 August 2026
You are already at the latest version
Abstract
For a graph G, let \( \nu_{\triangle}(G) \) be the largest number of pairwise edge-disjoint triangles and let \( \tau_{\triangle}(G) \) be the smallest number of edges meeting every triangle. Tuza's conjectured that \( \tau_{\triangle}(G)\leq 2\nu_{\triangle}(G) \) for every graph. We prove the conjecture for every split graph with a specified split partition \( V(G)=C\mathbin{\dot\cup}I \) such that \( |C|=8 \), for which the triangle-active vertices of I have at most two distinct neighborhoods in C. The result allows arbitrary multiplicities of the two types. The infinite statement is reduced to 44,702 canonical cases by an exact multiplicity-truncation lemma and symmetry. Each case carries an explicit triangle cover and an explicit edge-disjoint triangle packing, checked by an independent standard-library verifier. We also give exact cover and packing reductions for arbitrary split graphs and a maximum-cut criterion that settles, at \( |C|=8 \), every instance whose independent-side neighborhood 2-shadow has at most seven edges. The unrestricted split-graph and interval-graph cases remain open.
Keywords:
Tuza's conjecture
; split graph
; triangle packing
; triangle cover
; exact certificate
; computer-assisted proof
MSC: 05C70; 05C35; 68V05
1. Introduction
For a finite simple graph G, a triangle packing is a family of pairwise edge-disjoint triangles, and a triangle cover is a set of edges meeting every triangle. Write and for their maximum and minimum cardinalities. Tuza’s conjecture asserts
for every G [5]. It was posed at the 1981 Eger colloquium and has remained open in general.
Split and interval graphs remain important unresolved subclasses [3]. Some adjacent frontiers are known. The conjecture holds for threshold graphs [1], for -free chordal graphs [2], for an even-sided co-chain subclass of interval graphs [3], and for split graphs of order n and minimum degree at least [4]. Thus an eight-vertex clique part is the first partition size not covered merely by the -free chordal result. Notice that a specified split partition with can still have clique number larger than eight when an independent-side vertex is complete to C.
Our principal result is the following infinite, computer-assisted theorem. Vertices of I with at most one neighbor in C lie in no triangle and are called inactive.
Theorem 1.
Let G be a split graph with a specified split partition and . After deleting the inactive vertices of I, suppose that the sets , , take at most two distinct values. Then G satisfies (1).
The proof has two logically separate parts. First, an exact lemma truncates the multiplicity of every neighborhood type at . Second, symmetry reduces the one- and two-type instances at to records. Every record stores a feasible cover F and a feasible packing with . The independent verifier reconstructs all graph edges and all relevant triangles; it does not call the discovery program or an optimization solver.
We also prove exact cover and packing formulas for arbitrary split graphs and a maximum-cut sufficient condition. At the latter gives a purely human-verifiable theorem for arbitrary neighborhood types whenever the independent-side neighborhood 2-shadow has at most seven edges.
Theorem 1 is a partial result: it proves neither all split graphs nor all interval graphs. The literature search supporting the novelty and scope statements was last updated on August 17, 2026.
2. Exact Reductions for Split Graphs
Fix a split partition . Put for , and identify with .
Lemma 1
(Exact cover reduction). For , let
Then
where is the ordinary vertex-cover number.
Proof.
Let F be a triangle cover and . Since F meets every triangle inside C, the graph is triangle-free. For , set . If , then , so the triangle forces or . Hence is a vertex cover of , giving the lower bound in (2).
Conversely, take feasible X and a minimum vertex cover of every . Then
meets all clique triangles because is triangle-free. It also meets every triangle : either , or and one of belongs to . This proves the reverse bound. □
Equivalently, writing and , Lemma 1 gives
Lemma 2
(Exact packing reduction). For every , choose a matching , with the edge sets pairwise disjoint, and put . Then
Proof.
An edge represents the triangle . The matching condition prevents two triangles with center x from sharing a spoke; pairwise edge-disjointness prevents reuse of a clique edge. A clique-triangle packing in may then be added. Conversely, the clique edges of packed triangles centered at a fixed x form such a matching, and the remaining packed triangles lie in . □
For , let .
Lemma 3
(Multiplicity truncation). Let . Replacing every by leaves both and unchanged.
Proof.
Every triangle meeting I consumes a clique edge. Thus at most q copies of any one type can occur in a packing, and any used copies can be relabeled. This proves the packing assertion.
For covering, combine equal types in (3) and put
If the optimum for the truncated multiplicities equals q, the empty graph H has value q for the original multiplicities as well, so both optima are q. Otherwise let H be a truncated minimizer of value less than q. For every saturated type we must have , since otherwise that term alone is at least q. Hence the same H has exactly the same value for the original multiplicities. Monotonicity in every supplies the reverse inequality. □
3. A Maximum-Cut Criterion
Define the independent-side neighborhood 2-shadow Q on C by
The complement below is taken inside .
Theorem 2.
Let and . Then
Consequently, if
then G satisfies Tuza’s conjecture.
Proof.
For a cut , select every clique edge internal to A or B, together with every crossing edge belonging to Q. Every clique triangle has two vertices on the same side. A triangle is also met: if are on opposite sides, then by definition. The number of selected edges is . Maximizing the omitted crossing edges proves (6). The final assertion follows from , and hence . □
Corollary 1.
If and the shadow Q has at most seven edges, then G satisfies Tuza’s conjecture, with no restriction on the number or form of its neighborhood types.
Proof.
Choose a uniformly random balanced 4–4 cut of C. Each edge of Q crosses with probability , so some balanced cut has at most four crossing edges of Q. The cover used in Theorem 2 then has at most edges. On vertices , the triangles
are pairwise edge-disjoint. Thus , and the result follows. □
4. The Exact Certificate
We now prove Theorem 1. One active type is classified by its size . Two distinct active types are classified, up to a permutation of C and an exchange of , by
with . There are exactly 64 two-type classes. When , type exchange also permits .
By Lemma 3, it is enough to check multiplicities from 1 to 28. The canonical scope therefore contains one-type records and
two-type records, for records in total.
For each record, the certificate contains an explicit triangle cover and an explicit edge-disjoint triangle packing. A cover is serialized as a set of clique edges together with one spoke-endpoint mask for each type. A packing is serialized triangle by triangle, distinguishing clique triangles from triangles centered at a named independent vertex. The discovery program constructs packings from ordered round-robin matching factors of and , tries both type orders, and fills unused clique edges by an exact triangle-packing search. This construction is outside the trust boundary: only the stored witnesses matter.
For clarity, type compression does not identify different graph edges. If a type S has multiplicity m, the stored endpoint mask is applied separately to all m copies, contributing distinct spokes. The same mask meets every remaining centered triangle because all copies have the same clique neighborhood.
Proposition 1.
Every one of the canonical records contains a triangle cover F and an edge-disjoint triangle packing satisfying . The minimum certified slack is 4.
Exact verification.
The compressed certificate, generator, independent verifier, and manifest have respective SHA-256 values
Two consecutive verification reports are byte-identical, with SHA-256
The independent verifier uses only the Python standard library and imports nothing from the generator or the exact solver. It independently re-enumerates the 64 Venn classes and all records; rejects missing, reordered, malformed, or trailing data; expands each packed triangle into its three graph-edge tokens and checks pairwise edge-disjointness; and checks every clique triangle and independent-centered triangle against the stored cover. Finally it checks .
The canonical uncompressed JSONL data have SHA-256
09966099c6a19214ff585624cb0d1de8ea8c54406783701f4901bb0641a60bc8.
b4f1343c4aaa0b8f672b741eb69e61324d52997558abed3697abb09eb8ccdde5,
b186a126320bc0fcf1f97bfcf97e5e80208cc3423781c6c5f4a8982f9a042d03,
1dadda8af5be397fa768fca1a020acf97c6bce2f81cfd7b3979733d4eda0723f,
45d4b143b9b9eb87bc2e8b75916f4ce857a93cef48066a51c7697ad70eca1325.
b1e28e146088a76d5c5389b3522a04a09fbb011e2b67b7a595cacb1b08140514.
□
Proof of Theorem.
Delete inactive vertices, which occur in no triangle. If there are no active types, the triangle core is . The eight triangles displayed in the proof of Corollary 1 form a packing, while the 12 edges internal to a balanced 4–4 partition cover all clique triangles; hence .
Suppose there are one or two active types. Lemma 3 replaces each multiplicity by its minimum with 28 without changing either parameter. Relabeling C and, when applicable, exchanging the two types puts the instance into exactly one canonical record. Proposition 1 gives
□
Remark 1.
At multiplicity 28, the verifier also checks that every stored cover uses no spoke of the saturated type. Thus the same witnesses extend directly after adding twins. This check is redundant because Lemma 3 already proves the extension analytically.
5. Reproducibility and Limitations
From the project root, run
python3 experiments/ilp_breaker/verify_venn_k8.py
PYTHONPATH=src:experiments/ilp_breaker python3 -m pytest -q
No floating-point computation enters the proof. The certificate uses exact integer and bit-mask arithmetic. This is not a Lean or other proof-assistant formalization: the trust base consists of the finite reduction, the Python interpreter and standard library, the independent verifier, and the stored witnesses.
Computational and AI Disclosure
OpenAI’s Codex system assisted with route exploration, program construction, generation of exact certificates, adversarial checking, literature searches, and language editing. The mathematical statements, executable artifacts, and final manuscript remain the responsibility of the author. No claim of formal peer review or proof-assistant verification is made.
References
- Bonamy, Marthe; Bożyk, ukasz; Grzesik, Andrzej; Hatzel, Meike; Masařík, Tomáš; Novotná, Jana; Okrasa, Karolina. Tuza’s conjecture for threshold graphs. Discret. Math. Theor. Comput. Sci. 2022, 24(no. 1), 24. [Google Scholar] [CrossRef]
- Botler, Fábio; Fernandes, Cristina G.; Gutiérrez, Juan. On Tuza’s conjecture for triangulations and graphs with small treewidth. Discret. Math. 2021, 344(no. 4), 112281. [Google Scholar] [CrossRef]
- Chahua, Luis; Gutiérrez, Juan. On Tuza’s conjecture in co-chain graphs. arXiv 2023, arXiv:2211.07766v2. [Google Scholar]
- Chahua, Luis; Gutierrez, Juan. On Tuza’s conjecture in dense graphs. Discret. Appl. Math. 2025, 377, 225–233. [Google Scholar] [CrossRef]
- Tuza, Zsolt. A conjecture on triangles of graphs. Graphs Comb. 1990, 6(no. 4), 373–380. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.