105 citations · 718 across the 103 of their papers we have counts for
11 papers · 2 filters
Maximum determinant and permanent of sparse 0-1 matrices
Igor Araujo, József Balogh, Yuzhou Wang
We prove that the maximum determinant of an matrix, with entries in and at most non-zero entries, is at most , which is best possible when $k…
Ramsey upper density of infinite graph factors
József Balogh, Ander Lamaison
The study of upper density problems on Ramsey theory was initiated by Erdős and Galvin in 1993. In this paper we are concerned with the following problem: given a fixed finite grap…
Generalized rainbow Turán numbers of odd cycles
József Balogh, Michelle Delcourt, Emily Heath +1
Given graphs and , the generalized rainbow Turán number is the maximum number of copies of in an -vertex graph with a proper edge-co…
Chain method for panchromatic colorings of hypergraphs
Margarita Akhmejanova, József Balogh
We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex -coloring of a hypergraph is \emph{panchromatic} if every edge meets every color.…
Tilings in vertex ordered graphs
Jozsef Balogh, Lina Li, Andrew Treglown
Over recent years there has been much interest in both Turán and Ramsey properties of vertex ordered graphs. In this paper we initiate the study of embedding spanning structures in…
A Strengthening of the Erdős-Szekeres Theorem
József Balogh, Felix Christian Clemen, Emily Heath +1
The Erdős-Szekeres Theorem stated in terms of graphs says that any red-blue coloring of the edges of the ordered complete graph contains a red copy of the monotone incre…
Maximum size intersecting families of bounded minimum positive co-degree
József Balogh, Nathan Lemons, Cory Palmer
Let be an -uniform hypergraph. The \emph{minimum positive co-degree} of , denoted by , is the minimum such that if is…
On stability of the Erdős-Rademacher Problem
József Balogh, Felix Christian Clemen
Mantel's theorem states that every -vertex graph with edges, where , contains a triangle. The problem of determining the minimum number o…
On the discrepancies of graphs
József Balogh, Béla Csaba, Yifan Jing +1
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph , labels are assigned to the edges, and we…
Counting independent sets in regular hypergraphs
Jozsef Balogh, Bela Bollobas, Bhargav Narayanan
Amongst -regular -uniform hypergraphs on vertices, which ones have the largest number of independent sets? While the analogous problem for graphs (originally raised by Gr…
A discrepancy version of the Hajnal-Szemerédi theorem
József Balogh, Béla Csaba, András Pluhár +1
A perfect -tiling in a graph is a collection of vertex-disjoint copies of the clique in covering every vertex of . The famous Hajnal--Szemerédi theorem determ…