8 papers
On the generalized Turán number of complete bipartite graphs
Oliver Janzer, Sean Longbrake, Liana Yepremyan
For graphs and , the generalized Turán number denotes the maximum number of copies of in an -free graph on vertices. We prove that if $s\in…
Independent sets and colorings of -free graphs
Abhishek Dhawan, Oliver Janzer, Abhishek Methuku
Alon, Krivelevich, and Sudakov conjectured in 1999 that every -free graph of maximum degree at most has chromatic number . This was previously known only fo…
Regular subgraphs at every density
Debsoumya Chakraborti, Oliver Janzer, Abhishek Methuku +1
In 1975, ErdÅs and Sauer asked to estimate, for any constant , the maximum number of edges an -vertex graph can have without containing an -regular subgraph. In a recent…
Nearly tight bounds for MaxCut in hypergraphs
Oliver Janzer, Julien Portier
An -cut of a -uniform hypergraph is a partition of its vertex set into parts, and the size of the cut is the number of edges which have at least one vertex in each part.…
A Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
Oliver Janzer, Peter Manohar
A code is a -query locally decodable code (-LDC) if one can recover any chosen bit of the message with good confide…
Power saving for the Brown-ErdÅs-Sós problem
Oliver Janzer, Abhishek Methuku, Aleksa MilojeviÄ +1
Let denote the maximum number of edges in a 3-uniform hypergraph on vertices which does not contain vertices spanning at least edges. A central problem in…