OurBigBook About$ Donate
 Sign in Sign up

Erdős-Hajnal bound for the three-edge hypergraph on four vertices

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Ramsey theorem Uniform hypergraph Ramsey number
2026-09-24  0 By others on same topic  0 Discussions Create my own version
Let K4(3)−​ be the three-uniform hypergraph with three of the four possible edges on four vertices. Every K4(3)−​-free three-uniform hypergraph on N vertices has an independent set of size at least
cloglogNlogN​.
(1)
Equivalently, r(K4(3)−​,Kk(3)​)≤kCk.

 Ancestors (7)

  1. Uniform hypergraph Ramsey number
  2. Ramsey theorem
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 132 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook