Imagen de Portada

Block-weighted random graphs: planar and beyond

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kang, Mihyun, Salvy, Zéphyr, Wdowinski, Ronen
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Probability F.2.2; G.2.1; G.2.2; G.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Asymptotic Transfer in Critical Recursive Composition Schemes
por: Drmota, Michael, et al.
Publicado: (2026)

On the Min-Max Star Partitioning Number
por: Feldmann, Sarah, et al.
Publicado: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
por: Couto, Fernanda, et al.
Publicado: (2023)

Counting $P_3$-convex sets in graphs
por: Dourado, Mitre C., et al.
Publicado: (2026)

Criticality for Maker-Breaker domination games with predomination
por: Bujtás, Csilla, et al.
Publicado: (2025)

New bounds on the modularity of $G(n,p)$
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Action convergence of general hypergraphs and tensors
por: Zucal, Giulio
Publicado: (2023)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
por: Bo, Dong, et al.
Publicado: (2025)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
por: Gillman, David, et al.
Publicado: (2026)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
por: Donkiewicz, Tim, et al.
Publicado: (2026)

Edge and mixed metric dimension of Johnson graphs
por: Kratica, Jozef, et al.
Publicado: (2024)

Note on edge expansion and modularity in preferential attachment graphs
por: McDiarmid, Colin, et al.
Publicado: (2026)

Optimal covering of rectangular grid graphs with tours of constrained length
por: Bereg, Sergey, et al.
Publicado: (2025)

On rainbow domination of cubic graphs
por: Žerovnik, Janez
Publicado: (2024)

On Calculating the Chromatic Symmetric Function
por: Mobaraki, Nima Amoei, et al.
Publicado: (2024)

Breaking the Symmetries of Amenable Graphs
por: Cheng, Christine T.
Publicado: (2025)

Modularity of preferential attachment graphs
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Zero-free regions for the independence polynomial on restricted graph classes
por: Jerrum, Mark, et al.
Publicado: (2025)

Col is PSPACE-complete on Triangular Grids
por: Burke, Kyle, et al.
Publicado: (2025)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

Pseudorandomness of the Sticky Random Walk
por: Anand, Emile, et al.
Publicado: (2023)

A note on locating-dominating sets in twin-free graphs
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
por: Pavlov, Gorgi
Publicado: (2026)

Enumeration of Polyominoes up to Size N=59
por: Shirakawa, Toshihiro
Publicado: (2025)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
por: Büngener, Aaron, et al.
Publicado: (2024)

Graph Parameters, Universal Obstructions, and WQO
por: Paul, Christophe, et al.
Publicado: (2023)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
por: Cavallaro, Dario, et al.
Publicado: (2026)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
por: Bom, David, et al.
Publicado: (2025)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

Geometrization of Graphs: Towards Bounding the Chromatic Number via High-Dimensional Embedding
por: Fang, Qiming, et al.
Publicado: (2024)

On the Metric Dimension of $K_a \times K_b \times K_c$
por: Gledel, Valentin, et al.
Publicado: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

Unsplittable Multicommodity Flows in Outerplanar Graphs
por: Alemán-Espinosa, David, et al.
Publicado: (2025)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
por: Hochbaum, Dorit S.
Publicado: (2016)

On the Importance of Studying the Membership Problem for Pedigree Polytopes
por: Arthanari, Tiru
Publicado: (2025)

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
por: Nagel, Leonhard
Publicado: (2025)

Bipartite Turán problem on cographs
por: Zimmermann, Jakob Paul
Publicado: (2026)

Two-Sided Lossless Expanders in the Unbalanced Setting
por: Chattopadhyay, Eshan, et al.
Publicado: (2024)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
por: Bhandari, Kritika, et al.
Publicado: (2025)