Tree densities in sparse graph classes (Q5046563): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 2009.12989 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3088292866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles of length 4 in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many cliques in \(H\)-free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the sunflower lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on sunflowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree independent sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light edges in degree-constrained graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a graph of given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Independent Sets in Map Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the edge number of ak-map graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots and links in spatial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for independent set enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of complete subgraphs in a graph with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colouring of graphs excluding a subgraph or minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Graphs with Locally Restricted Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cliques in a graph embedded in a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a \(K_4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Turán-type theorem for cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, graph minors, and subgraph multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the maximum number of triangles in a <i>C</i><sub>5</sub>‐free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small minors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsically knotted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and tree-width of \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cliques in graphs with a forbidden minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kruskal-Katona type theorem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Number of Independent Sets of a Fixed Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for disjoint copies of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting copies of a fixed subgraph in \(F\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Colin de Verdière number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many, many more intrinsically knotted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of $P_\ell$ copies in $P_k$-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating 3-cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of cliques in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many triangles with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Cliques in Graphs with a Forbidden Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many H-Copies in Graphs with a Forbidden Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles of lengthk in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of cycles of length three in a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of cliques in graphs without long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sharp results on the generalized Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmically small minors and topological minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many \(F\)'s are there in \(G\)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On low tree-depth decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper minor-closed families are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots and links in spatial graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to find a separator in a graph excluding a minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Das Geschlecht des vollständigen paaren Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sachs' linkless embedding conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small complete minors above the extremal edge density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots in certain spatial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight Erdős-Pósa function for planar minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the frequency of 3-connected subgraphs of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 17:53, 30 July 2024

scientific article; zbMATH DE number 7613388
Language Label Description Also known as
English
Tree densities in sparse graph classes
scientific article; zbMATH DE number 7613388

    Statements

    Tree densities in sparse graph classes (English)
    0 references
    0 references
    0 references
    8 November 2022
    0 references
    extremal combinatorics
    0 references
    trees
    0 references
    graph minors
    0 references
    sparsity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references