The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs (Q2883861): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ervin Gyoeri / rank
Normal rank
 
Property / author
 
Property / author: Ervin Gyoeri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548311000629 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066118197 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:21, 30 July 2024

scientific article
Language Label Description Also known as
English
The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs
scientific article

    Statements

    The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references

    Identifiers