A note on geometric 3-hypergraphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every $n$-vertex geometric 3-hypergraph in 3-space with no two disjoint edges has at most $O(n^2)$ edges. These results support two conjectures that were raised by Dey and Pach, and by Akiyama and Alon.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A note on geometric 3-hypergraphs 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 A note on geometric 3-hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on geometric 3-hypergraphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-485837

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.