Counting Gallai 3-colorings of complete graphs (Q2312802): Difference between revisions

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

Revision as of 21:48, 19 July 2024

scientific article
Language Label Description Also known as
English
Counting Gallai 3-colorings of complete graphs
scientific article

    Statements

    Counting Gallai 3-colorings of complete graphs (English)
    0 references
    18 July 2019
    0 references
    Gallai colorings
    0 references
    rainbow triangles
    0 references
    complete graphs
    0 references
    counting
    0 references
    0 references
    0 references
    0 references

    Identifiers