Faithful universal graphs for minor-closed classes

DOI10.1137/25M1760799MaRDI QIDQ7395818zbMATH OpenFDO

Authors Paul Bastide, L. Esperet, Carla Groenland, Claire Hilaire, Clément Rambaud, Alexandra Wesolek

Publication date 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Cites work

• 2-linked graphs
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A family of countable homogeneous graphs
• A new proof of the flat wall theorem
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A problem of Ulam on planar graphs
• Adjacency labeling schemes and induced-universal graphs
• Adjacency Labelling for Planar Graphs (and Beyond)
• An extremal function for contractions of graphs
• Asymmetric graphs
• Asymptotically optimal induced universal graphs
• Catalan Numbers
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre.
• Disjoint paths in graphs
• Efficient graph representations
• Forbidden subgraphs and forbidden substructures
• scientific article; zbMATH DE number 5764887 (Why is no real title available?)
• scientific article; zbMATH DE number 3747149 (Why is no real title available?)
• scientific article; zbMATH DE number 16297 (Why is no real title available?)
• scientific article; zbMATH DE number 1222605 (Why is no real title available?)
• scientific article; zbMATH DE number 1944718 (Why is no real title available?)
• scientific article; zbMATH DE number 1833411 (Why is no real title available?)
• Implicat Representation of Graphs
• Logspace versions of the theorems of Bodlaender and Courcelle
• Lower bound of the Hadwiger number of graphs by their average degree
• Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
• Nonexistence of universal graphs without some trees
• On Graphs Which Contain All Sparse Graphs
• On the density of families of sets
• On the existence of countable universal graphs
• On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph
• On the order of the group of a planar map
• On Universal Graphs for Spanning Trees
• On universal graphs with forbidden topological subgraphs
• Optimal induced universal graphs and adjacency labeling for trees
• Optimal induced universal graphs for bounded-degree graphs
• Perfect Storage Representations for Families of Data Structures
• Renaming in distributed certification
• Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
• Shorter Labeling Schemes for Planar Graphs
• Simpler adjacency labeling for planar graphs with B-Trees
• Small universal graphs for bounded-degree planar graphs
• Some remarks on universal graphs
• Some remarks on universal graphs
• Some universal graphs
• Sparse universal graphs for bounded‐degree graphs
• Sparse universal graphs for planarity
• Subgraph-universal planar graphs for trees
• The Asymptotic Number of Unlabelled Regular Graphs
• The implicit graph conjecture is false
• The number of the maximal triangle-free graphs
• The random graph
• Twin-width and permutations
• Universal caterpillars
• Universal geometric graphs
• Universal graphs and induced-universal graphs
• Universal graphs and universal functions
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• Universal graphs with a forbidden near‐path or 2‐bouquet
• Universal graphs with a forbidden subgraph: block path solidity
• Universal graphs with a forbidden subtree
• Universal graphs with forbidden subgraphs and algebraic closure
• Universal graphs without large bipartite subgraphs
• Universality considerations in VLSI circuits

This page was built for publication: Faithful universal graphs for minor-closed classes

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