Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JGT
2016

favoriteEmaildiscussreport

53views more JGT 2016»

Coloring Triple Systems with Local Conditions

8 years 26 days ago

Coloring Triple Systems with Local Conditions

Download homepages.math.uic.edu

We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with eO( √ log log n) colors such that the edges spanned by every set of ﬁve vertices receive at least three distinct colors. This answers the ﬁrst open case of a question of Conlon-Fox-Lee-Sudakov [1] who asked whether such a coloring exists with (log n)o(1) colors.

Dhruv Mubayi

Real-time Traffic

JGT 2016 |

claim paper

Related Content

» Bicoloring Steiner Triple Systems

» Color Gamut Characterization Via Ray Tracing for Device Profile Generation

» A simple condition implying rapid mixing of singlesite dynamics on spin systems

» MultiObject Tracking Using Color Texture and Motion

» Robust contourbased object tracking integrating color and edge likelihoods

» Perceptual quality assessment of color images using adaptive signal representation

» Exploitation of 3D Images for Face Authentication Under Pose and Illumination Variations

» Partitioning Histopathological Images An Integrated Framework for Supervised ColorTexture ...

» Fast indexing for image retrieval based on local appearance with reranking

» A 2D3D face identification system for surveillance applications

Post Info
More Details (n/a)

Added	06 Apr 2016
Updated	06 Apr 2016
Type	Journal
Year	2016
Where	JGT
Authors	Dhruv Mubayi

Comments (0)