Triangles in Regular Graphs with Density Below One Half (Q3557499): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximizing the sum of the squares of the degrees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of the squares of degrees: sharp asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for degree sequences / rank
 
Normal rank

Latest revision as of 18:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Triangles in Regular Graphs with Density Below One Half
scientific article

    Statements

    Triangles in Regular Graphs with Density Below One Half (English)
    0 references
    0 references
    23 April 2010
    0 references
    minimum number of triangles
    0 references
    regular graphs
    0 references
    extremal graphs
    0 references

    Identifiers