An extremal theorem in the hypercube

Details An extremal theorem in the hypercube An extremal theorem in the hypercube

2010-05-04

arxiv.org/abs/1005.0582v1

Mathematics

Combinatorics

6 pages

Scientific paper

The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n which does not contain a copy of H. We find a wide class of subgraphs H, including all previously known examples, for which ex(Q_n, H) = o(e(Q_n)). In particular, our method gives a unified approach to proving that ex(Q_n, C_{2t}) = o(e(Q_n)) for all t >= 4 other than 5.

Affiliated with

Also associated with

No associations

Rating

An extremal theorem in the hypercube does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An extremal theorem in the hypercube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extremal theorem in the hypercube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532453