Flag algebras
From MaRDI portal
Publication:5444699
DOI10.2178/jsl/1203350785zbMath1146.03013OpenAlexW4248232393MaRDI QIDQ5444699
Publication date: 25 February 2008
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350785
graph isomorphismsasymptotic extremal combinatoricsdensities of substructuresformal algebraspositive graph homomorphisms
Extremal problems in graph theory (05C35) Algebraic combinatorics (05E99) Extremal set theory (05D05) Asymptotic enumeration (05A16) Model theory of finite structures (03C13) Basic linear algebra (15A99)
Related Items
On tripartite common graphs, C5 ${C}_{5}$ is almost a fractalizer, Concentration estimates for functions of finite high‐dimensional random arrays, From art and circuit design to geometry and combinatorics, Natural quasirandomness properties, Toward characterizing locally common graphs, The cycle of length four is strictly \(F\)-Turán-good, Uniform Turán density of cycles, Undecidability of polynomial inequalities in weighted graph homomorphism densities, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, The Spectrum of Triangle-Free Graphs, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Common graphs with arbitrary connectivity and chromatic number, Restricted problems in extremal combinatorics, Undecidability of linear inequalities in graph homomorphism densities, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, The Inducibility of Graphs on Four Vertices, Counting flags in triangle-free digraphs, INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES, On the inducibility of cycles, The feasible region for consecutive patterns of permutations is a cycle polytope, On the 3‐Local Profiles of Graphs, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Paths of length three are \(K_{r+1}\)-Turán-good, On the maximum diameter of \(k\)-colorable graphs, A problem of Erdős and Sós on 3-graphs, Cliques in Graphs With Bounded Minimum Degree, Books Versus triangles, A bound on the inducibility of cycles, Finitely forcible graph limits are universal, An extremal problem motivated by triangle-free strongly regular graphs, On the inducibility of oriented graphs on four vertices, Quasirandom permutations are characterized by 4-point densities, Symmetry in Turán sums of squares polynomials from flag algebras, Almost similar configurations, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Maximum number of almost similar triangles in the plane, Non-Three-Colourable Common Graphs Exist, Embedding tetrahedra into quasirandom hypergraphs, Non-bipartite \(k\)-common graphs, On the Local Profiles of Trees, The clique density theorem, Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012., Rainbow triangles in three-colored graphs, On the local structure of oriented graphs -- a case study in flag algebras, Limits of mappings, Pentagons in triangle-free graphs, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, An exact Turán result for tripartite 3-graphs, Tropicalization of graph profiles, Note on upper density of quasi-random hypergraphs, Sidorenko's conjecture for blow-ups, Extremal problems in uniformly dense hypergraphs, On the exact maximum induced density of almost all graphs and their inducibility, The codegree threshold of \(K_4^-\), Extremal graph theory and finite forcibility, The minimum number of triangles in graphs of given order and size, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Breaking symmetries to rescue sum of squares in the case of makespan scheduling, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric sums of squares over \(k\)-subset hypercubes, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Descriptive Power of Probability Logic, On the Minimal Density of Triangles in Graphs, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs, Finitely forcible graphons with an almost arbitrary structure, A new lower bound based on Gromov's method of selecting heavily covered points, The homomorphism domination exponent, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Strong forms of stability from flag algebra calculations, The inducibility of blow-up graphs, Monochromatic triangles in three-coloured graphs, On possible Turán densities, Simple graph density inequalities with no sum of squares proofs, Finitely forcible graphons and permutons, Semantic limits of dense combinatorial objects, On the KŁR conjecture in random graphs, Tilings in graphons, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the maximum density of fixed strongly connected subtournaments, A note on the inducibility of 4-vertex graphs, Flag algebras and the stable coefficients of the Jones polynomial, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Semidefinite Programming and Ramsey Numbers, The feasible region of hypergraphs, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, A New Bound for the 2/3 Conjecture, Packing triangles in \(K_4\)-free graphs, An analytic approach to stability, On the maximum number of five-cycles in a triangle-free graph, Finitely forcible graphons, Unnamed Item, Matching polytons, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, On the Maximum Quartet Distance between Phylogenetic Trees, Maximizing five-cycles in \(K_r\)-free graphs, A problem of Erdős on the minimum number of \(k\)-cliques, Hypergraphs Do Jump, The number of cliques in graphs of given order and size, Asymptotic Structure for the Clique Density Theorem, Characterization of quasirandom permutations by a pattern sum, Decomposing Graphs into Edges and Triangles, Minimizing the number of 5-cycles in graphs with given edge-density, More about sparse halves in triangle-free graphs, A hypergraph blow-up lemma, Minimum number of edges that occur in odd cycles, Closing in on Hill's Conjecture, On the Number of 4-Cycles in a Tournament, Weak regularity and finitely forcible graph limits, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Sharp bounds for decomposing graphs into edges and triangles, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, Compactness and finite forcibility of graphons, Poset limits can be totally ordered, Inducibility of directed paths, On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs, On Turán's \((3,4)\)-problem with forbidden subgraphs, On the algebraic and topological structure of the set of Turán densities, On the Density of Transitive Tournaments
Cites Work
