28 citations · 47 across the 15 of their papers we have counts for
5 papers · 2 filters
Unavoidable hypergraphs
M. Bucić, N. Draganić, B. Sudakov +1
The following very natural problem was raised by Chung and Erdős in the early 80's and has since been repeated a number of times. What is the minimum of the Turán number $\text{ex}…
The intersection spectrum of 3-chromatic intersecting hypergraphs
Matija Bucić, Stefan Glock, Benny Sudakov
For a hypergraph , define its intersection spectrum as the set of all intersection sizes of distinct edges . In their seminal paper from 1973 whi…
Large independent sets from local considerations
Matija Bucić, Benny Sudakov
The following natural problem was raised independently by Erdős-Hajnal and Linial-Rabinovich in the late 80's. How large must the independence number of a graph be whose…
Counting odd cycle free orientations of graphs
M. Bucić, B. Sudakov
In this short note we determine the maximum number, over all -vertex graphs , of orientations of containing no strongly connected cycle . This answers a part of…
Large cliques and independent sets all over the place
N. Alon, M. Bucić, B. Sudakov
We study the following question raised by Erdős and Hajnal in the early 90's. Over all -vertex graphs what is the smallest possible value of for which any vertices o…