6 papers · 1 filter
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…
Semi-inducibility of 4-vertex graphs
Levente Bodnár, Oleg Pikhurko
For a graph whose edges are coloured blue or red, the -semi-inducibility problem asks for the maximum, over all graphs of given order , of the number of injections fr…
Some exact inducibility-type results for graphs via flag algebras
Levente Bodnár, Oleg Pikhurko
The -edge-inducibility problem asks for the maximum number of -subsets inducing exactly edges that a graph of given order can have. Using flag algebras and…
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…