7 papers · 1 filter
On problems of Erdős and Baumann-Briggs on minimising the density of -cliques in graphs with forbidden subgraphs
Levente Bodnár, Oleg Pikhurko
Using flag algebras, we prove that the minimum density of -cliques in a large graph without an independent set of size is , thus resolving a new case…
FlagAlgebraToolbox: Flag Algebra Computations in SageMath
Levente Bodnár
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a…
Tetrahedron Conjecture in the -norm
Levente Bodnár, Wanfang Chen, Jinghua Deng +5
The famous Tetrahedron Conjecture of Turán from the 1940s asserts that the number of edges in an -vertex -graph without the tetrahedron, the complete -graph on four vertic…
Turán density of tight cycles minus one edge in the -norm
Levente Bodnár, Jinghua Deng, Jianfeng Hou +2
The -uniform tight -cycle minus one edge is the -graph on vertices consisting of consecutive triples in the cyclic order. We show that f…
The Turán density of short tight cycles
Levente Bodnár, Jared León, Xizhi Liu +1
The -uniform tight -cycle is the -graph on consisting of all consecutive triples in the cyclic order. Let be either…
Some exact values of the inducibility and statistics constants for hypercubes
Levente Bodnár, Oleg Pikhurko
We consider two types of problems: maximising, over subsets , the density of -subcubes in the -hypercube graph that span a subgraph such that $S\cap…