commit 7c96ee4ae129373fe519438d67b57b5b54873bcc
parent 8f1d577c16f1fe01112dfc62fc5beb60040ffdd2
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 29 Jan 2026 16:14:59 +0100
commit with codex
Diffstat:
4 files changed, 17 insertions(+), 3 deletions(-)
diff --git a/cycle b/cycle
@@ -20,9 +20,11 @@ Special cases:
- [eulerian_cycle]
- [odd_cycle]
- [even_cycle]
+- [triangle] (length 3)
+- [4_cycle]
Up: [graph_basic_notions]
Aliases: cycles
-See also: [2_regular]
+See also: [2_regular], [cycle_basis]
diff --git a/cycle_basis b/cycle_basis
@@ -0,0 +1,11 @@
+# Cycle basis
+
+https://en.wikipedia.org/wiki/Cycle_basis
+
+A [basis] of the [cycle_space] of a [graph]
+
+Notion of [basis_number] of a graph as the smallest k such that there is a cycle basis using each edge at most k times. A graph is [planar_graph] iff it has basis number at most 2
+- cf [schmeichel1981basis]
+- cf [geniet2026basis] for [graph_excluding_minors]
+
+Up: [cycle]
diff --git a/cycle_problem b/cycle_problem
@@ -2,7 +2,8 @@
The [computational_problem] of finding a [cycle] in a [graph]
-[yuster1997finding] for [cycle_even]
+- [yuster1997finding] for [cycle_even]
+- [abboud2026truly] for a subcubic [combinatorial_algorithm] for [4_cycles]
See also: [clique_problem]
diff --git a/graph_h_minor_free b/graph_h_minor_free
@@ -12,4 +12,4 @@ Up: [graph_free]
See also: [graph_h_free]
-Aliases: H minor free, minor free, H minor free graph, H minor free graphs, excluded minor
+Aliases: H minor free, minor free, H minor free graph, H minor free graphs, excluded minor, graph excluding minor, graphs excluding minor, graph excluding minors
