HIGHLIGHTS
- What: The aim of this paper is to prove some similar results concerning %(F) for t-intersecting families for n > ck with relatively small constants c.
- Who: Peter Frankla and collaborators from the (UNIVERSITY) have published the research work: Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs, in the Journal: (JOURNAL)
SUMMARY
A family F ⊂ is called t-intersecting if |F ∩ F 0 | ⩾ t k for all F, F 0 ∈ F and t a positive integer. Wilson closed the gap 2 ⩽ t ⩽ 14 by a proof valid for all t . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.