Subgraph densities in a surface
From MaRDI portal
Recommendations
- Subgraph densities in hypergraphs
- Subgraphs of graphs on surfaces with high representativity
- On substructure densities of hypergraphs
- Dense subgraphs in random graphs
- Subgraph distributions in dense random regular graphs
- Subgraph counts for dense random graphs with specified degrees
- Determination of the densest subgraph
- In search of the densest subgraph
- Subgraph densities in \(K_r\)-free graphs
- On Finding Dense Subgraphs
Cites work
- \(C_{2k}\)-saturated graphs with no short odd cycles
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- A linear-time algorithm to find a separator in a graph excluding a minor
- A note on the maximum number of triangles in a C5‐free graph
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- All 2-manifolds have finitely many minimal triangulations
- All orientable 2-manifolds have finitely many minimal triangulations
- An additivity theorem for the genus of a graph
- Bounds on the number of cycles of length three in a planar graph
- Cliques in graphs excluding a complete graph minor
- Connectivity, graph minors, and subgraph multiplicity
- Counting copies of a fixed subgraph in F-free graphs
- Generalized planar Turán numbers
- Generalized Turán problems for disjoint copies of graphs
- Graphs on surfaces
- Hierarchy of surface models and irreducible triangulations.
- How many F's are there in G?
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3902677 (Why is no real title available?)
- scientific article; zbMATH DE number 3529891 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Improved bounds for the sunflower lemma
- Inducibility and universality for trees
- Intersection Theorems for Systems of Sets
- Irreducible triangulations are small
- Irreducible triangulations of the Klein bottle
- Irreducible triangulations of the torus
- Large networks and graph limits
- Left and right convergence of graphs with bounded degree
- Limits of locally-globally convergent graph sequences
- Many \(T\) copies in \(H\)-free graphs
- Many cliques in \(H\)-free subgraphs of random graphs
- Note on irreducible triangulations of surfaces
- Note on the irreducible triangulations of the Klein bottle
- Number of cliques in graphs with a forbidden subdivision
- On Sets of Acquaintances and Strangers at any Party
- On the frequency of 3-connected subgraphs of planar graphs
- On the local profiles of trees
- On the maximum number of cliques in a graph
- On the maximum number of cliques in a graph embedded in a surface
- On the Minimal Density of Triangles in Graphs
- On the number of cliques in graphs with a forbidden minor
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
- 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
- On the structure of linear graphs
- Paths vs. stars in the local profile of trees
- Proper minor-closed families are small
- Rank-width and tree-width of \(H\)-minor-free graphs
- Recurrence of distributional limits of finite planar graphs
- Recurrence of planar graph limits
- Separating 3-cycles in plane triangulations
- Some sharp results on the generalized Turán numbers
- The clique density theorem
- The maximum number of P_\ell copies in P_k-free graphs
- The maximum number of cliques in graphs without long cycles
- The maximum number of paths of length four in a planar graph
- The nonorientable genus is additive
- The number of cliques in graphs of given order and size
- Tree densities in sparse graph classes
- Undecidability of linear inequalities in graph homomorphism densities
- Unified approach to the generalized Turán problem and supersaturation
Cited in
(8)- Counting paths, cycles, and blow‐ups in planar graphs
- Planar graphs with the maximum number of induced 6-cycles
- On the maximum number of cliques in a graph embedded in a surface
- Bounding the number of odd paths in planar graphs via convex optimization
- Counting cycles in planar triangulations
- The maximum number of pentagons in a planar graph
- The maximum number of copies of an even cycle in a planar graphs (extended abstract)
- The maximum number of odd cycles in a planar graph
This page was built for publication: Subgraph densities in a surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886343)
