39 citations · 146 across the 54 of their papers we have counts for
4 papers · 1 filter
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…
Edge-disjoint cycles with the same vertex set
Debsoumya Chakraborti, Oliver Janzer, Abhishek Methuku +1
In 1975, Erdős asked for the maximum number of edges that an -vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Turá…
Tight general bounds for the extremal numbers of 0-1 matrices
Barnabás Janzer, Oliver Janzer, Van Magnan +1
A zero-one matrix is said to contain another zero-one matrix if we can delete some rows and columns of and replace some -entries with -entries such that the resul…