On the Zarankiewicz problem for intersection hypergraphs
- 1 July 2016
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 141, 1-7
Abstract
No abstract availableKeywords
Funding Information
- ANR SAGA (JCJC-14-CE25-0016-01)
- Swiss National Science Foundation (200020-144531, 200020-162884)
This publication has 13 references indexed in Scilit:
- Applications of a New Separator Theorem for String GraphsCombinatorics, Probability and Computing, 2013
- On Range Searching with Semialgebraic Sets. IISIAM Journal on Computing, 2013
- A Separator Theorem for String Graphs and its ApplicationsCombinatorics, Probability and Computing, 2009
- Separator theorems and Turán-type results for planar intersection graphsAdvances in Mathematics, 2008
- On planar intersection graphs with forbidden subgraphsJournal of Graph Theory, 2008
- CUTTINGS AND APPLICATIONSInternational Journal of Computational Geometry & Applications, 1995
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- On Graphs that do not Contain a Thomsen GraphCanadian Mathematical Bulletin, 1966
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964
- On a problem of K. ZarankiewiczColloquium Mathematicum, 1954