1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
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…
The Ramsey Number of Fano Plane Versus Tight Path
József Balogh, Felix Christian Clemen, Jozef Skokan +1
The hypergraph Ramsey number of two -uniform hypergraphs and , denoted by , is the least integer such that every red-blue edge-coloring of the complete -un…
Ordered Size Ramsey Number of Paths
József Balogh, Felix Christian Clemen, Emily Heath +1
An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path to be the monotone increasing path with edges. The ordered size Ramsey number…