THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE (Q5108414): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098568300 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1712.00633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of different orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Sidorenko's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some advances on Sidorenko's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Smallest Root of the Independence Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Rademacher-Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials have a unique root of smallest modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of triangles and squares in regular finite and unimodular random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph norms and Sidorenko's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of linear inequalities in graph homomorphism densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the boundary of the region defined by homomorphism densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 3‐Local Profiles of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturation problem for the bowtie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Structure for the Clique Density Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two approaches to Sidorenko’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5721211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting substructures. I: Color critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cliques in graphs of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles in an Ordinary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Structure of Graphs with the Minimum Number of Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturation problem for color-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique density theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:39, 22 July 2024

scientific article; zbMATH DE number 7195896
Language Label Description Also known as
English
THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
scientific article; zbMATH DE number 7195896

    Statements

    THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2020
    0 references
    Erdős-Rademacher problem
    0 references
    extremal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers