Flagmatic

swMATH6815MaRDI QIDQ18890FDOQ18890

Author name not available (Why is that?)

Cited In (30)

• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On the exact maximum induced density of almost all graphs and their inducibility
• On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
• On the maximum quartet distance between phylogenetic trees
• On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
• Universality of Graphs with Few Triangles and Anti-Triangles
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Symmetric sums of squares over \(k\)-subset hypercubes
• Pentagons in triangle-free graphs
• A problem of Erdős and Sós on 3-graphs
• On tripartite common graphs
• On the inducibility of oriented graphs on four vertices
• Maximum number of almost similar triangles in the plane
• Minimum number of edges that occur in odd cycles
• The codegree threshold of \(K_4^-\)
• Semidefinite Programming and Ramsey Numbers
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Strong forms of stability from flag algebra calculations
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• A hypergraph Turán problem with no stability
• Inducibility of directed paths
• A note on the inducibility of 4-vertex graphs
• Symmetry in Turán sums of squares polynomials from flag algebras
• Maximizing five-cycles in \(K_r\)-free graphs
• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
• Almost similar configurations
• On Turán's \((3,4)\)-problem with forbidden subgraphs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs

This page was built for software: Flagmatic