Papers
Topics
Authors
Recent
Search
2000 character limit reached

Monochromatic combinatorial lines of length three

Published 23 Oct 2018 in math.CO | (1810.09767v2)

Abstract: We show that there is a constant $c$ such that any colouring of the cube $[3]n$ in $c \log \log n$ colours contains a monochromatic combinatorial line.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. David Conlon 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up