5 citations · 8 across the 9 of their papers we have counts for
9 papers
Edge-colorings avoiding patterns in a triangle
Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt
For positive integers and , we consider -vertex graphs with the maximum number of -edge-colorings with no copy of a triangle where exactly two colors appear. We prove…
Canonical theorems for colored integers with respect to some linear combinations
Maria Axenovich, David S. Gunderson, Hanno Lefmann
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that…
An extension of the rainbow Erdős-Rothschild problem
Carlos Hoppen, Hanno Lefmann, Denilson Amaral Nolibos
Given integers , and , and a graph , we consider -edge-colorings of with no copy of a complete graph on vertice…
The rainbow Erdős-Rothschild problem for the Fano plane
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann +1
The Fano plane is the unique linear 3-uniform hypergraph on seven vertices and seven hyperedges. It was recently proved that, for all , the balanced complete bipartite 3-…
A note on a stability result for the Fano plane
Carlos Hoppen, Hanno Lefmann, Knut Odermann
In this note, we adapt the Keevash-Sudakov proof of the (Turán) Stability Theorem for the Fano plane to find an explicit dependency between the parameters and . Th…
On the query complexity of estimating the distance to hereditary graph properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
Given a family of graphs , we prove that the normalized edit distance of any given graph to being induced -free is estimable with a query complexity t…