ProbXiv
Explorersign in
Problem archiveProblem record

Statement

David Conlon Question 14. Let g(n) be the smallest number of colors necessary to edge-color Kn such that there are no two vertex-disjoint color-isomorphic triangles. Estimate g(n). \sqrt{ } It is not hard to show that c n \leq g(n) \leq n − 4 for some c > 0. It is conjectured that g(n) grows linearly in n and it may even be that g(n) = n − O(1). Conlon, Fox and Pham have shown that g(n) \geq cn1/2+\varepsilon for some \varepsilon > 0. Jacques Verstraete An (n, d, \lambda)-graph is a d-regular n-vertex graph whose adjacency matrix has, be- sides d, all eigenvalues in [−\lambda, \lambda].

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.