On a Conjecture of Nagy on Extremal Densities

DOI10.1137/19M1296525zbMath1460.05093arXiv1910.13465OpenAlexW3133888441WikidataQ123331887 ScholiaQ123331887MaRDI QIDQ5854460

A. Nicholas Day, Amites Sarkar

Publication date: 17 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.13465

zbMATH Keywords

extremal graph theorysubgraph countsgraph densitiesfractional independence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Unnamed Item
• The clique density theorem
• Extremal problems for independent set enumeration
• Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
• Some intersection theorems for ordered sets and graphs
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• On the number of copies of one hypergraph in another
• Upper tails for subgraph counts in random graphs
• A correlation inequality for bipartite graphs
• Multipodal structure and phase transitions in large constrained graphs
• Maximum star densities
• Graphs with maximal number of adjacent pairs of edges
• Properties of vertex packing and independence system polyhedra
• On the Number of 4-Edge Paths in Graphs With Given Edge Density
• On the maximum number of copies of H in graphs with given size and order