![[2606.02856] Geometric Routing in Geometric Inhomogeneous Random Graphs](/static/img/curated/desks/afbytes-tech.png)
[2606.02856] Geometric Routing in Geometric Inhomogeneous Random Graphs
Abstract page for arXiv paper 2606.02856: Geometric Routing in Geometric Inhomogeneous Random Graphs
America Forever Bytes
graph theory · AFBytes
Other
graph theory
Recent coverage
[2606.03067] Trajectory-Aware Node Contributions and the Limits of Static Controllability
Abstract page for arXiv paper 2606.03067: Trajectory-Aware Node Contributions and the Limits of Static Controllability
[2606.03267] Characterization and chromatic number of triangle-free graphs with diameter 2
Abstract page for arXiv paper 2606.03267: Characterization and chromatic number of triangle-free graphs with diameter 2
[2606.03419] Optimizing Explicit Unit-Distance Lower-Bound Certificates
Abstract page for arXiv paper 2606.03419: Optimizing Explicit Unit-Distance Lower-Bound Certificates
[2606.03765] Token-sliding realizability for complements, Cartesian-products, and grid graph families
Abstract page for arXiv paper 2606.03765: Token-sliding realizability for complements, Cartesian-products, and grid graph families
[2606.02621] A Fibonacci theorem for Collatz trajectories via modular graph structure
Abstract page for arXiv paper 2606.02621: A Fibonacci theorem for Collatz trajectories via modular graph structure
[2606.02855] $K_{2, t+1}$-free graphs containing an optimal number of $K_{t, t}$'s
Abstract page for arXiv paper 2606.02855: $K_{2, t+1}$-free graphs containing an optimal number of $K_{t, t}$'s
[2606.03520] Finite palette endpoints and degree-square Turán problems
Abstract page for arXiv paper 2606.03520: Finite palette endpoints and degree-square Turán problems
[2606.00758] Statistical Testing on Directed Graphs by Surrogate Data Generation
Abstract page for arXiv paper 2606.00758: Statistical Testing on Directed Graphs by Surrogate Data Generation
[2605.30402] Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs
Abstract page for arXiv paper 2605.30402: Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs
[2605.30821] The spectral inducibility of graphs
Abstract page for arXiv paper 2605.30821: The spectral inducibility of graphs
[2605.30830] Ollivier Ricci curvature on graphs obtained by removing edges from complete graphs
Abstract page for arXiv paper 2605.30830: Ollivier Ricci curvature on graphs obtained by removing edges from complete graphs
[2605.30949] Edge Subdivision and the Perron Eigenvalue of Tree Ricci Matrices
Abstract page for arXiv paper 2605.30949: Edge Subdivision and the Perron Eigenvalue of Tree Ricci Matrices
[2605.31398] Universality for rainbow oriented cycles in perturbed digraphs
Abstract page for arXiv paper 2605.31398: Universality for rainbow oriented cycles in perturbed digraphs
[2605.31071] Tree Containment Parameterized by Scanwidth
Abstract page for arXiv paper 2605.31071: Tree Containment Parameterized by Scanwidth
[2605.30730] Vertex-transitive quantum graphs
Abstract page for arXiv paper 2605.30730: Vertex-transitive quantum graphs
[2411.01753] Some conjectures on $r$-graphs and equivalences
Abstract page for arXiv paper 2411.01753: Some conjectures on $r$-graphs and equivalences
[2605.29540] Dichotomy study of the Steiner tree problem in split-like graphs
Abstract page for arXiv paper 2605.29540: Dichotomy study of the Steiner tree problem in split-like graphs
[2605.28518] Counterexamples to a Clique Immersion Conjecture for Direct Products
Abstract page for arXiv paper 2605.28518: Counterexamples to a Clique Immersion Conjecture for Direct Products
[2605.28537] Vertex-critical $(P_5,\text{chair})$-free and $(P_5,\text{cricket})$-free graphs
Abstract page for arXiv paper 2605.28537: Vertex-critical $(P_5,\text{chair})$-free and $(P_5,\text{cricket})$-free graphs
[2011.04650] Large rainbow matchings in edge-colored graphs
Abstract page for arXiv paper 2011.04650: Large rainbow matchings in edge-colored graphs
[2506.20086] Minors of non-hamiltonian polyhedra and the Herschel family
Abstract page for arXiv paper 2506.20086: Minors of non-hamiltonian polyhedra and the Herschel family
[2510.24336] Semi-inducibility of 4-vertex graphs
Abstract page for arXiv paper 2510.24336: Semi-inducibility of 4-vertex graphs
[2511.00254] Uncrossed Multiflows and Applications to Disjoint Paths
Abstract page for arXiv paper 2511.00254: Uncrossed Multiflows and Applications to Disjoint Paths
[2605.28772] Sampling Random Graphs from the Colored Configuration Model
Abstract page for arXiv paper 2605.28772: Sampling Random Graphs from the Colored Configuration Model