16 citations · 67 across the 17 of their papers we have counts for
6 papers · 1 filter
Planar Turán Numbers of Cycles: A Counterexample
Daniel W. Cranston, Bernard Lidický, Xiaonan Liu +1
The planar Turan number is the largest number of edges in an -vertex planar graph with no -cycle. For , upper…
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…
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…
Inducibility of 4-vertex tournaments
Dalton Burke, Bernard Lidický, Florian Pfender +1
We determine the inducibility of all tournaments with at most vertices together with the extremal constructions. The -vertex tournament containing an oriented and one…
is almost a fractalizer
Bernard Lidický, Connor Mattes, Florian Pfender
We determine the maximum number of induced copies of a 5-cycle in a graph on vertices for every . Every extremal construction is a balanced iterated blow-up of the 5-cycle w…
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}…