Saved in:
| Main Authors: | Díaz, Josep, Diner, Öznur Yaşar, Serna, Maria, Serra, Oriol |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.12323 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A phase transition in block-weighted random maps
by: Fleurat, William, et al.
Published: (2023)
by: Fleurat, William, et al.
Published: (2023)
Unified study of the phase transition for block-weighted random planar maps
by: Salvy, Zéphyr
Published: (2024)
by: Salvy, Zéphyr
Published: (2024)
The critical activation density in graph bootstrap percolation
by: Kolesnik, Brett, et al.
Published: (2026)
by: Kolesnik, Brett, et al.
Published: (2026)
The diameter of KPKVB random graphs
by: Müller, Tobias, et al.
Published: (2017)
by: Müller, Tobias, et al.
Published: (2017)
Typical structure of sparse exponential random graph models
by: Cook, Nicholas A., et al.
Published: (2022)
by: Cook, Nicholas A., et al.
Published: (2022)
Temporal Exploration of Random Spanning Tree Models
by: Baguley, Samuel, et al.
Published: (2025)
by: Baguley, Samuel, et al.
Published: (2025)
Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
Tripodal structure in undersaturated random graphs
by: DiCarlo, William, et al.
Published: (2025)
by: DiCarlo, William, et al.
Published: (2025)
Metric representations by minimal graphs
by: Franco-Sánchez, Víctor, et al.
Published: (2026)
by: Franco-Sánchez, Víctor, et al.
Published: (2026)
Degree-preserving graph dynamics -- a versatile process to construct random networks
by: Erdős, Péter L., et al.
Published: (2021)
by: Erdős, Péter L., et al.
Published: (2021)
On the strength of connectedness of unions of random graphs
by: Bloznelis, Mindaugas
Published: (2026)
by: Bloznelis, Mindaugas
Published: (2026)
Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)
by: Anderson, Sara, et al.
Published: (2026)
Augmentations of Forman's Ricci Curvature and their Applications in Community Detection
by: Fesser, Lukas, et al.
Published: (2023)
by: Fesser, Lukas, et al.
Published: (2023)
VC-dimension of subsets of Hamming graphs
by: Housholder, Christopher, et al.
Published: (2025)
by: Housholder, Christopher, et al.
Published: (2025)
The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)
by: Mörters, Peter, et al.
Published: (2025)
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
The zero blocking numbers of grid graphs
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
by: Cervantes, Jillian, et al.
Published: (2024)
by: Cervantes, Jillian, et al.
Published: (2024)
Zero blocking numbers of graphs with complexity results
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
The unavoidable drawings of complete multipartite graphs
by: Balogh, Jozsef, et al.
Published: (2025)
by: Balogh, Jozsef, et al.
Published: (2025)
Book crossing numbers of the complete graph and small local convex crossing numbers
by: Ábrego, Bernardo M., et al.
Published: (2016)
by: Ábrego, Bernardo M., et al.
Published: (2016)
Reconstructing a graph from the distance matrix of its boundary
by: Cáceres, José, et al.
Published: (2024)
by: Cáceres, José, et al.
Published: (2024)
Asymptotic diameter of preferential attachment model
by: Du, Hang, et al.
Published: (2025)
by: Du, Hang, et al.
Published: (2025)
On dispersability of some circulant graphs
by: Kainen, Paul C., et al.
Published: (2021)
by: Kainen, Paul C., et al.
Published: (2021)
Optimal subgraphs in geometric scale-free random graphs
by: Michielan, Riccardo, et al.
Published: (2024)
by: Michielan, Riccardo, et al.
Published: (2024)
Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)
by: Imbesi, Maurizio, et al.
Published: (2017)
An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)
by: Stošić, Ivan, et al.
Published: (2025)
Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)
by: Inoue, Yuta, et al.
Published: (2024)
Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)
by: Inoue, Yuta, et al.
Published: (2025)
Excluding surfaces as minors in graphs
by: Thilikos, Dimitrios M., et al.
Published: (2026)
by: Thilikos, Dimitrios M., et al.
Published: (2026)
Thrackles on nonplanar surfaces
by: Hernández-Vélez, César, et al.
Published: (2025)
by: Hernández-Vélez, César, et al.
Published: (2025)
Canonical colourings in random graphs
by: Kamčev, Nina, et al.
Published: (2023)
by: Kamčev, Nina, et al.
Published: (2023)
Efficient graph similarity assessment method based on vectors of topological indices
by: Dehmer, Matthias, et al.
Published: (2025)
by: Dehmer, Matthias, et al.
Published: (2025)
Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)
by: Baligacs, Julia, et al.
Published: (2025)
Ramsey simplicity of random graphs
by: Boyadzhiyska, Simona, et al.
Published: (2021)
by: Boyadzhiyska, Simona, et al.
Published: (2021)
When do the Kahn-Kalai Bounds Provide Nontrivial Information?
by: Christopherson, Bryce Alan, et al.
Published: (2024)
by: Christopherson, Bryce Alan, et al.
Published: (2024)
Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
Similar Items
-
A phase transition in block-weighted random maps
by: Fleurat, William, et al.
Published: (2023) -
Unified study of the phase transition for block-weighted random planar maps
by: Salvy, Zéphyr
Published: (2024) -
The critical activation density in graph bootstrap percolation
by: Kolesnik, Brett, et al.
Published: (2026) -
The diameter of KPKVB random graphs
by: Müller, Tobias, et al.
Published: (2017) -
Typical structure of sparse exponential random graph models
by: Cook, Nicholas A., et al.
Published: (2022)