Ordered and colored subgraph density problems

DOI10.1137/24m1651563MaRDI QIDQ6668349

Emily Cairncross, Dhruv Mubayi

Publication date: 22 January 2025

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

zbMATH Keywords

colored graphsordered graphsgraphons

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• The feasible region of induced graphs
• The number of cliques in graphs of given order and size
• Maximum star densities
• Hypergraph limits: A regularity approach
• On Sets of Acquaintances and Strangers at any Party
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• Graphs with maximal number of adjacent pairs of edges
• On the Maximum Induced Density of Directed Stars and Related Problems
• Triangles in an Ordinary Graph
• The inducibility of oriented stars

This page was built for publication: Ordered and colored subgraph density problems