Pages that link to "Item:Q4657678"
From MaRDI portal
The following pages link to THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES (Q4657678):
Displaying 45 items.
- A rainbow Erdős-Rothschild problem (Q322299) (← links)
- Edge-colorings avoiding fixed rainbow stars (Q324811) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- The typical structure of graphs with no large cliques (Q681594) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- The number of Gallai \(k\)-colorings of complete graphs (Q777474) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- On the number of edges not covered by monochromatic copies of a fixed graph. (Q1425108) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Maximum number of sum-free colorings in finite abelian groups (Q1659538) (← links)
- Stability of extremal hypergraphs with applications to an edge-coloring problem (Q1689923) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Edge colorings of graphs without monochromatic stars (Q2005736) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- Integer colorings with no rainbow \(k\)-term arithmetic progression (Q2143413) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
- A remark on the number of edge colorings of graphs (Q2368713) (← links)
- On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- On the maximum number of integer colourings with forbidden monochromatic sums (Q2662340) (← links)
- Graphs with many edge-colorings such that complete graphs are rainbow (Q2700627) (← links)
- Kneser colorings of uniform hypergraphs (Q2851466) (← links)
- Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (Q2857389) (← links)
- Edge colourings of graphs avoiding monochromatic matchings of a given size (Q2883863) (← links)
- On Colourings of Hypergraphs Without Monochromatic Fano Planes (Q3552505) (← links)
- Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors (Q4568091) (← links)
- A Rainbow Erdös--Rothschild Problem (Q4596826) (← links)
- Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (Q4920648) (← links)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- Exact stability for Turán’s Theorem (Q5028504) (← links)
- Counting <i>H</i>-free orientations of graphs (Q5058452) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)
- On Two Problems in Ramsey--Turán Theory (Q5351866) (← links)
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
- Stability for the Erdős-Rothschild problem (Q5887143) (← links)
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs (Q6081589) (← links)
- Integer colorings with forbidden rainbow sums (Q6111260) (← links)
- Exact solutions to the Erdős-Rothschild problem (Q6178441) (← links)
- Edge-colorings avoiding patterns in a triangle (Q6197754) (← links)
- Maximum number of triangle-free edge colourings with five and six colours (Q6621168) (← links)