wiki_research

commit 79a9161f059e7495e99bc3333443ca411b73b302
parent 6d5088b61598ac5a21f336d7cf266ee0825c5d04
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Tue,  8 Jul 2025 12:23:58 +0200

commit with codex

Diffstat:
graph_coloring
 | 
4
++++
mycielskian
 | 
7
+++++++

2 files changed, 11 insertions(+), 0 deletions(-)
diff --git a/graph_coloring b/graph_coloring
@@ -33,6 +33,10 @@
   - see https://cstheory.stackexchange.com/questions/51368/which-hypergraphs-can-be-simplified-by-alternatively-removing-a-hyperedge-and-an
 - [bipartiteness_testing] (k=2)
 
+## Constructions
+
+- [Mycielskian]
+
 ## References
 
 "Graph Coloring Methods" book: https://graphcoloringmethods.com/
diff --git a/mycielskian b/mycielskian
@@ -0,0 +1,7 @@
+# Mycielskian
+
+https://en.wikipedia.org/wiki/Mycielskian
+
+Given a [triangle_free_graph] with [chromatic_number] k, builds a [triangle_free_graph] with [chromatic_number] k+1
+
+Up: [graph_coloring]