[HTML][HTML] The number of Gallai k-colorings of complete graphs
J de Oliveira Bastos, FS Benevides, J Han - Journal of Combinatorial …, 2020 - Elsevier
An edge coloring of the n-vertex complete graph, K n, is a Gallai coloring if it does not
contain any rainbow triangle, that is, a triangle whose edges are colored with three distinct …
contain any rainbow triangle, that is, a triangle whose edges are colored with three distinct …
[HTML][HTML] Counting Gallai 3-colorings of complete graphs
An edge coloring of the n-vertex complete graph K n is a Gallai coloring if it does not contain
any rainbow triangle, that is, a triangle whose edges are colored with three distinct colors …
any rainbow triangle, that is, a triangle whose edges are colored with three distinct colors …
[HTML][HTML] A minimum-change version of the Chung–Feller theorem for Dyck paths
T Mütze, C Standke, V Wiechert - European Journal of Combinatorics, 2018 - Elsevier
A Dyck path of length 2 k with e flaws is a path in the integer lattice that starts at the origin
and consists of k many↗-steps and k many↘-steps that change the current coordinate by …
and consists of k many↗-steps and k many↘-steps that change the current coordinate by …
[PDF][PDF] Monochromatic structures in edge-coloured graphs and hypergraphs-a survey
Shinya Fujita, Henry Liu, Colton Magnant regarding these questions. In most cases, the
edge-coloured (hyper) graph is either complete, or non-complete but with a density …
edge-coloured (hyper) graph is either complete, or non-complete but with a density …