The feasible region of induced graphs
From MaRDI portal
Publication:2101166
DOI10.1016/j.jctb.2022.09.003zbMath1502.05102arXiv2106.16203OpenAlexW3173429254MaRDI QIDQ2101166
Xizhi Liu, Christian Reiher, Dhruv Mubayi
Publication date: 28 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.16203
Related Items (2)
Stability from graph symmetrisation arguments with applications to inducibility ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique density theorem
- A note on the inducibility of 4-vertex graphs
- The inducibility of graphs
- On the boundary of the region defined by homomorphism densities
- The feasible region of hypergraphs
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \)
- The number of cliques in graphs of given order and size
- Maximum star densities
- On Sets of Acquaintances and Strangers at any Party
- On the Local Profiles of Trees
- On the Minimal Density of Triangles in Graphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On complete subgraphs of different orders
- A Remark on the Number of Complete and Empty Subgraphs
- The inducibility of complete bipartite graphs
- Anticoncentration for subgraph statistics
- Edge-statistics on large graphs
- THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
- A completion of the proof of the Edge-statistics Conjecture
- Undecidability of linear inequalities in graph homomorphism densities
- The Inducibility of Graphs on Four Vertices
- On the 3‐Local Profiles of Graphs
- Stability from graph symmetrisation arguments with applications to inducibility
This page was built for publication: The feasible region of induced graphs
