Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
From MaRDI portal
Publication:6084357
DOI10.4230/lipics.approx/random.2020.14OpenAlexW3082834230MaRDI QIDQ6084357
Philipp Kuinke, Jan Dreier, Peter Rossmanith
Publication date: 31 October 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12617/pdf/LIPIcs-APPROX14.pdf/
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Graph clustering
- Limit distribution of degrees in random family trees
- Characterisations and examples of graph classes with bounded expansion
- Diameters in preferential attachment models
- The diameter of a scale-free random graph
- Degree asymptotics with rates for preferential attachment random graphs
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Grad and classes with bounded expansion. I: Decompositions
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Emergence of Scaling in Random Networks
- (Meta) Kernelization
- The small-world phenomenon
- Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs
- On Random Intersection Graphs: The Subgraph Problem
- Deciding First-Order Properties of Nowhere Dense Graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- The Maximum Degree of the Barabási–Albert Random Tree
- A critical point for random graphs with a given degree sequence
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Joint degree distributions of preferential attachment random graphs
- Collective dynamics of ‘small-world’ networks
- The average distances in random graphs with given expected degrees
- Motif Counting in Preferential Attachment Graphs
This page was built for publication: Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
