Counting Gallai 3-colorings of complete graphs

DOI10.1016/j.disc.2019.05.015zbMath1416.05098arXiv1805.06805OpenAlexW2963820491WikidataQ127750733 ScholiaQ127750733MaRDI QIDQ2312802

Ignasi Sau, Guilherme Oliveira Mota, Fabrício Siqueira Benevides, Josefran de Oliveira Bastos

Publication date: 18 July 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.06805

zbMATH Keywords

countingcomplete graphsrainbow trianglesGallai colorings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Remarks on an edge-coloring problem ⋮ Complete edge-colored permutation graphs ⋮ Distribution of colors in Gallai colorings ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Remarks on the distribution of colors in Gallai colorings

Cites Work

• Unnamed Item
• Unnamed Item
• The number of \(C_{2\ell}\)-free graphs
• A rainbow Erdős-Rothschild problem
• Hypergraph containers
• The number of \(K_{m,m}\)-free graphs
• Gallai colorings of non-complete graphs
• A note on perfect graphs
• Perfect couples of graphs
• An extremal problem for random graphs and the number of graphs with large even-girth
• Counting sum-free sets in abelian groups
• Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• Acyclic edge-coloring using entropy compression
• The number of the maximal triangle-free graphs
• The number of maximal sum-free subsets of integers
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Edge colorings of complete graphs without tricolored triangles
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• On the Number ofB_h-Sets
• Transitiv orientierbare Graphen
• Graph pairs and their entropies: Modularity problems

This page was built for publication: Counting Gallai 3-colorings of complete graphs