Subgraph densities in a surface
From MaRDI portal
Publication:5886343
DOI10.1017/S0963548321000560OpenAlexW4206699056MaRDI QIDQ5886343
Gwenaël Joret, Tony Huynh, David R. Wood
Publication date: 31 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.13777
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)
Related Items (2)
Counting paths, cycles, and blow‐ups in planar graphs ⋮ Planar graphs with the maximum number of induced 6-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cliques in graphs excluding a complete graph minor
- The clique density theorem
- Paths vs. stars in the local profile of trees
- All 2-manifolds have finitely many minimal triangulations
- How many \(F\)'s are there in \(G\)?
- On the maximum number of cliques in a graph embedded in a surface
- Rank-width and tree-width of \(H\)-minor-free graphs
- Note on the irreducible triangulations of the Klein bottle
- Irreducible triangulations of the torus
- Irreducible triangulations are small
- On the maximum number of cliques in a graph
- An additivity theorem for the genus of a graph
- All orientable 2-manifolds have finitely many minimal triangulations
- Bounds on the number of cycles of length three in a planar graph
- Irreducible triangulations of the Klein bottle
- Hierarchy of surface models and irreducible triangulations.
- Many cliques in \(H\)-free subgraphs of random graphs
- The maximum number of cliques in graphs without long cycles
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- Recurrence of distributional limits of finite planar graphs
- Recurrence of planar graph limits
- Some sharp results on the generalized Turán numbers
- Unified approach to the generalized Turán problem and supersaturation
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- \(C_{2k}\)-saturated graphs with no short odd cycles
- On the number of cliques in graphs with a forbidden minor
- Limits of locally-globally convergent graph sequences
- Proper minor-closed families are small
- The maximum number of paths of length four in a planar graph
- Generalized planar Turán numbers
- The number of cliques in graphs of given order and size
- On Sets of Acquaintances and Strangers at any Party
- Intersection Theorems for Systems of Sets
- Number of Cliques in Graphs with a Forbidden Subdivision
- On the Local Profiles of Trees
- On the Minimal Density of Triangles in Graphs
- On the frequency of 3-connected subgraphs of planar graphs
- The nonorientable genus is additive
- On the number of cycles of length 4 in a maximal planar graph
- On the number of cycles of lengthk in a maximal planar graph
- Connectivity, graph minors, and subgraph multiplicity
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
- A note on the maximum number of triangles in a C5‐free graph
- Note on irreducible triangulations of surfaces
- Left and right convergence of graphs with bounded degree
- Tree densities in sparse graph classes
- Inducibility and universality for trees
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
- Improved bounds for the sunflower lemma
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Undecidability of linear inequalities in graph homomorphism densities
- On the structure of linear graphs
- Separating 3-cycles in plane triangulations
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Subgraph densities in a surface
