Skip to main content
×
Home
    • Aa
    • Aa

Self-Similarity Bounds for Locally Thin Set Families

  • EMANUELA FACHINI (a1), JÁNOS KÖRNER (a1) and ANGELO MONTI (a1)
Abstract

A family of subsets of an n-set is k-locally thin if, for every k-tuple of its members, the ground set has at least one element contained in exactly one of them. For k = 5 we derive a new exponential upper bound for the maximum size of these families. This implies the same bound for all odd values of k > 3. Our proof uses the graph entropy bounding technique to exploit a self-similarity in the structure of the hypergraph associated with such set families.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 15 *
Loading metrics...

Abstract views

Total abstract views: 40 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 18th October 2017. This data will be updated every 24 hours.