collaborators

11 papers

math.CO2026

The inducibility of 6-vertex graphs

Levente Bodnár, Jun Gao, Jared León +3

The inducibility constant of a graph is the asymptotically maximum induced density of in a growing sequence of graphs. This paper systematically investigates the c…

math.CO2026

Strong non-principality of positive codegree Turán density

Levente Bodnár, Jun Gao, Oleg Pikhurko +2

The \emph{minimum positive codegree} of a -graph is the minimum, over all -sets that lie in at least one edge, of the number of edges containing that…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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 an…

math.CO2026

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…