Pages that link to "Item:Q2890303"
From MaRDI portal
The following pages link to The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings (Q2890303):
Displaying 30 items.
- 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)
- An analytic approach to stability (Q710597) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← 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)
- 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)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
- A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) (Q2380208) (← 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)
- Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (Q2857389) (← 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)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- Counting <i>H</i>-free orientations of graphs (Q5058452) (← 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)
- 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)