18 citations · 39 across the 17 of their papers we have counts for
4 papers · 1 filter
Large hypergraphs without tight cycles
Barnabás Janzer
An -uniform tight cycle of length is a hypergraph with vertices and edges (for all ), with the indices taken mod…
A note on the orientation covering number
Barnabás Janzer
Given a graph , its orientation covering number is the smallest non-negative integer with the property that we can choose orientations of such that whenever $…
The generalised rainbow Turán problem for cycles
Barnabás Janzer
Given an edge-coloured graph, we say that a subgraph is rainbow if all of its edges have different colours. Let rainbow- denote the maximal number of co…
Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques
W. T. Gowers, Barnabás Janzer
Considering a natural generalization of the Ruzsa-Szemerédi problem, we prove that for any fixed positive integers with , there are graphs on vertices containing $n^…