ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let us end with an open problem. simpler than the earlier proofs. However, the proof that I will present today is a new proof using the mixture bound that is due to Maya Sankar. Using the idea in the proof, we can generalize the rainbow triangle theorem to more q colors and show that a simple r-edge-colored graph with m edges has at most 2(r−2) 9r m 3/2

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.