On the Number of 4-Edge Paths in Graphs With Given Edge Density (Q5366950): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of subgraphs of prescribed type of graphs with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of certain subgraphs contained in graphs with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths of length four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipodal structure and phase transitions in large constrained graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / 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: 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548316000389 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2561562985 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 2024

scientific article; zbMATH DE number 6788956
Language Label Description Also known as
English
On the Number of 4-Edge Paths in Graphs With Given Edge Density
scientific article; zbMATH DE number 6788956

    Statements

    Identifiers