Extremal Parameters in Sub-Critical Graph Classes

DOI10.1137/1.9781611973037.1MaRDI QIDQ5194732zbMATH OpenOpenAlexFDO

Authors Michael Drmota, Marc Noy

Publication date 17 September 2019

Published in 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973037.1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Extremal subgraphs with respect to vertex degree bounds
• Extremal subgraphs of random graphs
• Extremal subgraphs of random graphs
• On extremal subgraphs of random graphs
• An extremal result for subgraphs with few edges
• Asymptotic study of subcritical graph classes
• Extremal subgraphs for two graphs
• Extremal graphs with bounded densities of small subgraphs
• scientific article; zbMATH DE number 2123255
• scientific article; zbMATH DE number 3841900

Cited in

(13)

• Random enriched trees with applications to random graphs
• Limits of random tree-like discrete structures
• Maximal independent sets and maximal matchings in series-parallel and related graph classes
• Spanning trees in random series-parallel graphs
• Asymptotic properties of random unlabelled block-weighted graphs
• Maximum degree in minor-closed classes of graphs
• Subcritical graph classes containing all planar graphs
• Expected Maximum Block Size in Critical Random Graphs
• Exact-Size Sampling of Enriched Trees in Linear Time
• Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
• The scaling limit of random cubic planar graphs
• Scaling limit of graph classes through split decomposition
• Random graphs from a block-stable class

This page was built for publication: Extremal Parameters in Sub-Critical Graph Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194732)