Ramsey numbers of loose triangles versus cliques
math.CO
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- Off-diagonal Ramsey numbers
- Coloring small locally sparse degenerate graphs and related problems
- When are off-diagonal hypergraph Ramsey numbers polynomial?
- Fractional coloring via entropy
- List coloring uncrowded hypergraphs at the shattering threshold
- Off-diagonal hypergraph Ramsey numbers
- The chromatic number of triangle-free hypergraphs
- A survey of hypergraph Ramsey problems
- A polynomial criterion for DP-coloring of uncrowded hypergraphs
- On independent sets in uncrowded uniform hypergraphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality