On set systems with a threshold property
From MaRDI portal
Publication:856857
DOI10.1016/j.disc.2006.06.001zbMath1109.05104OpenAlexW1992471277MaRDI QIDQ856857
Robert H. Sloan, Ken Takata, György Turán, Zoltan Fueredi
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.001
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- Supersaturated graphs and hypergraphs
- An exact result for 3-graphs
- How to make a graph bipartite
- A note on the probabilistic approach to Turan's problem
- Lower bounds for Turán's problem
- Three-graphs without two triples whose symmetric difference is contained in a third
- On frequent sets of Boolean matrices
- On hypergraphs with every four points spanning at most two triples
- On a two-sided Turán problem
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Non-uniform Turán-type problems
- Maximal consistent families of triples
- Upper bounds for Turán numbers