Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold

05/23/2023
by   David Conlon, et al.
0

For positive integers n,r,s with r > s, the set-coloring Ramsey number R(n;r,s) is the minimum N such that if every edge of the complete graph K_N receives a set of s colors from a palette of r colors, then there is a subset of n vertices where all of the edges between them receive a common color. If n is fixed and s/r is less than and bounded away from 1-1/n-1, then R(n;r,s) is known to grow exponentially in r, while if s/r is greater than and bounded away from 1-1/n-1, then R(n;r,s) is bounded. Here we prove bounds for R(n;r,s) in the intermediate range where s/r is close to 1 - 1/n-1 by establishing a connection to the maximum size of error-correcting codes near the zero-rate threshold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2020

A note on the simultaneous edge coloring

Let G=(V,E) be a graph. A (proper) k-edge-coloring is a coloring of the ...
research
04/19/2019

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...
research
02/01/2021

Role Coloring Bipartite Graphs

A k-role coloring alpha of a graph G is an assignment of k colors to the...
research
10/27/2021

Rainbow cycles for families of matchings

Given a graph G and a coloring of its edges, a subgraph of G is called r...
research
01/31/2023

New bounds and constructions for neighbor-locating colorings of graphs

A proper k-coloring of a graph G is a neighbor-locating k-coloring if fo...
research
02/04/2021

Minimizing the alphabet size in codes with restricted error sets

This paper focuses on error-correcting codes that can handle a predefine...
research
09/25/2017

On the error of a priori sampling: zero forcing sets and propagation time

Zero forcing is an iterative process on a graph used to bound the maximu...

Please sign up or login with your details

Forgot password? Click here to reset