105 citations · 718 across the 103 of their papers we have counts for
15 papers · 2 filters
Rainbow connectivity of randomly perturbed graphs
József Balogh, John Finlay, Cory Palmer
In this note we examine the following random graph model: for an arbitrary graph , with quadratic many edges, construct a graph by randomly adding edges to and rando…
Proper elements of Coxeter groups
József Balogh, David Brewster, Reuven Hodges
We extend the notion of proper elements to all Coxeter groups. For all infinite families of finite Coxeter groups we prove that the probability a random element is proper goes to z…
Maximal -wise intersecting families
József Balogh, Ce Chen, Kevin Hendrey +4
A family on ground set is maximal -wise intersecting if every collection of at most sets in has non-empty intersection,…
Solving Turán's Tetrahedron Problem for the -Norm
József Balogh, Felix Christian Clemen, Bernard Lidický
Turán's famous tetrahedron problem is to compute the Turán density of the tetrahedron . This is equivalent to determining the maximum -norm of the codegree vector of…
Hypergraph Turán Problems in -Norm
József Balogh, Felix Christian Clemen, Bernard Lidický
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with th…
On generalized Turán results in height two posets
József Balogh, Ryan R. Martin, Dániel T. Nagy +1
For given posets and and an integer , the generalized Turán problem for posets, asks for the maximum number of copies of in a -free subset of the -dimensional…
Counting -graphs without forbidden configurations
József Balogh, Felix Christian Clemen, Letícia Mattos
One of the major problems in combinatorics is to determine the number of -uniform hypergraphs (-graphs) on vertices which are free of certain forbidden structures. This p…
Sharp threshold for the Erdős-Ko-Rado theorem
József Balogh, Robert A. Krueger, Haoran Luo
For positive integers and with , the Kneser graph is the graph with vertex set consisting of all -sets of , where two -sets are ad…
Intersecting families of sets are typically trivial
József Balogh, Ramon I. Garcia, Lina Li +1
A family of subsets of is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combina…
Short proofs of three results about intersecting systems
József Balogh, William Linz
In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial -uniform, -wise interse…
Max Cuts in Triangle-free Graphs
József Balogh, Felix Christian Clemen, Bernard Lidický
A well-known conjecture by Erdős states that every triangle-free graph on vertices can be made bipartite by removing at most edges. This conjecture was known for graph…
An upper bound on the size of Sidon sets
József Balogh, Zoltán Füredi, Souktik Roy
In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by in a classical combinatorial number theory…
Lower bounds on the Erdős-Gyárfás problem via color energy graphs
József Balogh, Sean English, Emily Heath +1
Given positive integers and , a -coloring of the complete graph is an edge-coloring in which every -clique receives at least colors. Erdős and Shelah pos…
Maximum Number of Almost Similar Triangles in the Plane
József Balogh, Felix Christian Clemen, Bernard Lidický
A triangle is -similar to another triangle if their angles pairwise differ by at most . Given a triangle , and $n\in\mathbb{N}…
On the number of sum-free triplets of sets
Igor Araujo, József Balogh, Ramon I. Garcia
We count the ordered sum-free triplets of subsets in the group , i.e., the triplets of sets for which the e…