Uniform hypergraphs containing no grids

Details Uniform hypergraphs containing no grids Uniform hypergraphs containing no grids

2011-03-09

arxiv.org/abs/1103.1691v1

Mathematics

Combinatorics

29 pages, one .eps figure

Scientific paper

A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct singletons. A hypergraph is linear if every pair of edges meet in at most one vertex. In this paper we construct large linear r-hypergraphs which contain no grids. Moreover, a similar construction gives large linear r-hypergraphs which contain neither grids nor triangles. For r at least 4 our constructions are almost optimal. These investigations are also motivated by coding theory: we get new bounds for optimal superimposed codes and designs.

Affiliated with

Also associated with

No associations

Rating

Uniform hypergraphs containing no grids 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 Uniform hypergraphs containing no grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform hypergraphs containing no grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643471