commit aa482e38cc623f7eb84a852ca1ca28115a64c0d8
parent f79149402b0e15ec5b5debdd84246447289b18b8
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Mon, 16 Feb 2026 15:08:29 +0100
commit with codex
Diffstat:
7 files changed, 21 insertions(+), 6 deletions(-)
diff --git a/disjoint_union b/disjoint_union
@@ -2,6 +2,8 @@
The [union] of two [sets] that are [disjoint]
+- [graph_disjoint_union]
+
Up: [union]
Aliases: disjoint unions
diff --git a/graph_basic_notions b/graph_basic_notions
@@ -34,6 +34,7 @@
- [incidence_graph]
- [balanced_separator]
- [graph_product]
+- [graph_empty]
Up: [graph]
diff --git a/graph_empty b/graph_empty
@@ -0,0 +1,9 @@
+# Graph empty
+
+A [graph] with no [edges], or sometimes the graph with no [edges] and no [vertices]
+
+Up: [graph_basic_notions]
+
+Aliases: empty graph
+
+See also: [independent_set], [single_vertex_graph]
diff --git a/graph_family b/graph_family
@@ -29,7 +29,8 @@ A (generally [infinite]) set of [graphs]
- [graph_free]
- [graph_h_free]
- [graph_induced_h_free]
- - [graph_pk_free]
+ - [Pk_free_graphs]
+ - [P4_free_graphs]
- [graph_h_minor_free]
- [graph_sparse]
diff --git a/graph_p5_free b/graph_p5_free
@@ -5,3 +5,5 @@ https://www.graphclasses.org/classes/gc_396.html
cf, e.g., [chudnowski2023cops]
Up: [graph_pk_free]
+
+Aliases: P5 free graph, P5 free graphs
diff --git a/graph_pk_free b/graph_pk_free
@@ -2,14 +2,14 @@
An [undirected_graph] is *P_k-free* if it does not have an [induced_subgraph] which is [graph_isomorphic] to a [path] on k [vertices]
-- P_2-free means no [edge] at all, so [graph_empty], or [independent_set]
+- P_2-free means no [edge] at all, so [empty_graph], or [independent_set]
- P_3-free means every [connected_component] is a [clique]
- https://math.stackexchange.com/questions/3564039/describe-all-graphs-that-do-not-contain-p-3-as-an-induced-subgraph
-- P_4-free are precisely the [cographs]
-- P_5-free: [graph_p5_free]
+- [P4_free_graphs] are precisely the [cographs]
+- [P5_free_graphs]
Up: [graph_family], [graph_h_free]
-Aliases: PK free graph
+Aliases: PK free graph, PK free graphs
See also: [forbidden_minor]
diff --git a/independent_set b/independent_set
@@ -26,7 +26,7 @@ An *independent set* is a [subset] of [vertices] of an [undirected_graph] such t
[fractional_independent_set]
- like [fractional_edge_cover] vs [edge_cover]
-See also: [matching], [vertex_cover]
+See also: [matching], [vertex_cover], [empty_graph]
Up: [graph_substructure]
