2 citations · 6 across the 11 of their papers we have counts for
19 papers · 1 filter
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 for a…
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.…
Short monochromatic odd cycles
Oliver Janzer, Fredy Yip
It is easy to see that every -edge-colouring of the complete graph on vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smalle…
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
Barnabás Janzer, Oliver Janzer, Abhishek Methuku +1
In 2006, Marcus and Tardos proved that if are cyclic orders on some subsets of a set of symbols such that the common elements of any two distinct orders a…
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 b…
The probability that a random graph is even-decomposable
Oliver Janzer, Fredy Yip
A graph with an even number of edges is called even-decomposable if there is a sequence such that for each , $G[V_i]…