Tree densities in sparse graph classes
From MaRDI portal
Publication:5046563
DOI10.4153/S0008414X21000316zbMath1506.90260arXiv2009.12989OpenAlexW3088292866MaRDI QIDQ5046563
Publication date: 8 November 2022
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.12989
Related Items (4)
Subgraph densities in a surface ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022
Cites Work
- Small complete minors above the extremal edge density
- Sparsity. Graphs, structures, and algorithms
- Small minors in dense graphs
- Independent sets in graphs with given minimum degree
- On the Colin de Verdière number of graphs
- Extremal problems for independent set enumeration
- Two problems on independent sets in graphs
- 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
- Lower bound of the Hadwiger number of graphs by their average degree
- On low tree-depth decompositions
- A Kruskal-Katona type theorem for graphs
- On the maximum number of cliques in a graph
- The maximum number of cliques in dense graphs
- Knots in certain spatial graphs
- Bounds on the number of cycles of length three in a planar graph
- Quickly excluding a forest
- Bounds on the number of complete subgraphs
- The maximum number of triangles in a \(K_4\)-free graph
- 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
- Bounded-degree independent sets in planar graphs
- Gap-planar graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Light edges in degree-constrained graphs
- A new Turán-type theorem for cliques in graphs
- Recognizing string graphs is decidable
- Sachs' linkless embedding conjecture
- Some sharp results on the generalized Turán numbers
- Note on sunflowers
- Generalized Turán problems for even cycles
- Defective colouring of graphs excluding a subgraph or minor
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- Das Geschlecht des vollständigen paaren Graphen
- On the number of cliques in graphs with a forbidden minor
- An annotated bibliography on 1-planarity
- Many triangles with few edges
- The maximum number of complete subgraphs in a graph with given maximum degree
- Many, many more intrinsically knotted graphs
- Proper minor-closed families are small
- Homomorphiesätze für Graphen
- On the degrees of the vertices of a directed graph
- Knots and links in spatial graphs: a survey
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Approximation Algorithms for Independent Sets in Map Graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
- Parameters Tied to Treewidth
- Knots and links in spatial graphs
- Map graphs
- Intersection Theorems for Systems of Sets
- An extremal function for contractions of graphs
- Number of Cliques in Graphs with a Forbidden Subdivision
- New bounds on the edge number of ak-map graph
- Intrinsically knotted graphs
- On the frequency of 3-connected subgraphs of planar graphs
- 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
- A note on the maximum number of triangles in a C5‐free graph
- A tight Erdős-Pósa function for planar minors
- The maximum number of triangles in a graph of given maximum degree
- Improved bounds for the sunflower lemma
- Logarithmically small minors and topological minors
- Many H-Copies in Graphs with a Forbidden Tree
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Structure of Graphs with Locally Restricted Crossings
- Maximizing the Number of Independent Sets of a Fixed Size
- Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
- On the structure of linear graphs
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Separating 3-cycles in plane triangulations
- Many \(T\) copies in \(H\)-free graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tree densities in sparse graph classes
