On set systems with a threshold property
From MaRDI portal
Publication:856857
DOI10.1016/J.DISC.2006.06.001zbMATH Open1109.05104OpenAlexW1992471277MaRDI QIDQ856857FDOQ856857
Authors: Zoltán Füredi, R. H. Sloan, Ken Takata, Gy. Turán
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- How to make a graph bipartite
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exact result for 3-graphs
- Title not available (Why is that?)
- Supersaturated graphs and hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Title not available (Why is that?)
- Maximal consistent families of triples
- On hypergraphs with every four points spanning at most two triples
- Non-uniform Turán-type problems
- Title not available (Why is that?)
- Upper bounds for Turán numbers
- Lower bounds for Turán's problem
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- A note on the probabilistic approach to Turan's problem
- On frequent sets of Boolean matrices
- On a two-sided Turán problem
Cited In (1)
This page was built for publication: On set systems with a threshold property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856857)