New bounds on Simonyi's conjecture

DOI10.1016/J.EJC.2018.01.005zbMath1384.05152arXiv1510.07597OpenAlexW2963833465WikidataQ122875924 ScholiaQ122875924MaRDI QIDQ1746583

Daniel Soltész

Publication date: 25 April 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07597

zbMATH Keywords

recovering pair

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (1)

A new upper bound for cancellative pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly cancellative and recovering sets on lattices
• Union-free hypergraphs and probability theory
• On the optimal structure of recovering set pairs in lattices: The sandglass conjecture
• Cancellative pairs of families of sets
• Recovering Set Systems and Graph Entropy
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• Analysis of Deterministic Binary Interference Channels Via a General Outer Bound

This page was built for publication: New bounds on Simonyi's conjecture