18 citations · 39 across the 17 of their papers we have counts for
21 papers
Extending Thomassen's conjecture to directed graphs
Micha Christoph, Barnabás Janzer, Kalina Petrova +1
A famous conjecture by Thomassen from 1983 asserts that for any given there exists some such that every graph of minimum degree at leas…
Sunflowers and Ramsey problems for restricted intersections
Barnabás Janzer, Zhihan Jin, Benny Sudakov +1
Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 years. In this paper, we study the following Ramsey versi…
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…
Chromatic number and regular subgraphs
Barnabás Janzer, Raphael Steiner, Benny Sudakov
In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every , an integer such that every graph with chromatic number at least…
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…
Packing the largest trees in the tree packing conjecture
Barnabás Janzer, Richard Montgomery
The famous tree packing conjecture of Gyárfás from 1976 says that any sequence of trees such that for each packs into the complete -vertex…
Ordered Ramsey numbers of powers of paths
António Girão, Barnabás Janzer, Oliver Janzer
Given two vertex-ordered graphs and , the ordered Ramsey number is the smallest such that whenever the edges of a vertex-ordered complete graph are red/…
A collection of open problems in celebration of Imre Leader's 60th birthday
Rahil Baber, Natalie Behague, Asier Calbet +10
One of the great pleasures of working with Imre Leader is to experience his infectious delight on encountering a compelling combinatorial problem. This collection of open problems…
On locally rainbow colourings
Barnabás Janzer, Oliver Janzer
Given a graph , let denote the smallest for which the following holds. We can assign a -colouring of the edge set of to each vertex in with…
Rotation inside convex Kakeya sets
Barnabás Janzer
Let be a convex body (a compact convex set) in , that contains a copy of another body in every possible orientation. Is it always possible to continuously mov…
Partial shuffles by lazy swaps
Barnabás Janzer, J. Robert Johnson, Imre Leader
What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an -point set to ensure that eac…
Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1
Consider the hypergraph bootstrap percolation process in which, given a fixed -uniform hypergraph and starting with a given hypergraph , at each step we add to al…
A note on saturation for -wise intersecting families
Barnabás Janzer
A family of subsets of is called -wise intersecting if any members of have non-empty intersection, and it is called maximal -w…
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
Gellért Weisz, Philip Amortila, Barnabás Janzer +3
We consider local planning in fixed-horizon MDPs with a generative model under the assumption that the optimal value function lies close to the span of a feature map. The generativ…
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^…
Projections of antichains
Barnabás Janzer
A subset of is called a weak antichain if it does not contain two elements and satisfying for all . Engel, Mitsis, Pelekis and Reiher showed…
A note on antichains in the continuous cube
Barnabás Janzer
It is well-known that an antichain in the poset must have measure zero. Engel, Mitsis, Pelekis and Reiher showed that in fact it must have -dimensional Hausdorff m…
A New Upper Bound for Cancellative Pairs
Barnabás Janzer
A pair of families of subsets of an -element set is called cancellative if whenever and satisfy $A\cup B=A'\cu…