


default search action
Random Structures and Algorithms, Volume 64
Volume 64, Number 1, January 2024
RESEARCH ARTICLES
- Bertille Granet, Felix Joos

:
Random perfect matchings in regular graphs. 3-14 - Michael Fuchs

, Hexuan Liu
, Tsan-Cheng Yu:
Limit theorems for patterns in ranked tree-child networks. 15-37 - Paul Balister, Béla Bollobás, Robert Morris

, Paul Smith:
Subcritical monotone cellular automata. 38-61 - Stijn Cambie

, Wouter Cames van Batenburg
, Ewan Davies
, Ross J. Kang
:
Packing list-colorings. 62-93 - Jie Han, Patrick Morris

, Guanghui Wang, Donglei Yang:
A Ramsey-Turán theory for tilings in graphs. 94-124 - Matthew S. Brennan, Guy Bresler, Brice Huang:

Threshold for detecting high dimensional geometry in anisotropic random geometric graphs. 125-137 - Guanwu Liu, Jie Ma

, Chunlei Zu:
Optimal bisections of directed graphs. 138-153
Volume 64, Number 2, March 2024
RESEARCH ARTICLES
- Lucas Aragão

, Maurício Collares Neto, João Pedro Marciano, Taísa Martins, Robert Morris
:
A lower bound for set-coloring Ramsey numbers. 157-169 - Sergey Dovgal, Élie de Panafieu

, Dimbinaina Ralaivaosaona
, Vonjy Rasendrahasina, Stephan G. Wagner:
The birth of the strong components. 170-266 - Wei-Kuo Chen

, Wai-Kit Lam
:
Universality of superconcentration in the Sherrington-Kirkpatrick model. 267-286 - Jacob Fox, Zoe M. Himwich

, Nitya Mani
:
Extremal results on feedback arc sets in digraphs. 287-308 - Brett Leroux

, Luis Rademacher
:
Expansion of random 0/1 polytopes. 309-319 - Ádám Timár, László Márton Tóth

:
A full characterization of invariant embeddability of unimodular planar graphs. 320-353 - Frederik Sørensen

:
A down-up chain with persistent labels on multifurcating trees. 354-400 - Asaf Cohen Antonir:

The upper tail problem for induced 4-cycles in sparse random graphs. 401-459 - Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo:

On a rainbow extremal problem for color-critical graphs. 460-489 - Reza Gheissari

, Alistair Sinclair:
Spatial mixing and the random-cluster dynamics on lattices. 490-534
Volume 64, Number 3, May 2024
RESEARCH ARTICLES
- Mehrdad Moharrami

, V. Subramanian
, M. Liu, R. Sundaresan:
The Erlang weighted tree, a new branching process. 537-624 - Tao Jiang, Shoham Letzter, Abhishek Methuku

, Liana Yepremyan:
Rainbow subdivisions of cliques. 625-644 - István Tomon

:
Coloring lines and Delaunay graphs with respect to boxes. 645-662 - António Girão, Freddie Illingworth

, Alex D. Scott, David R. Wood:
Defective coloring of hypergraphs. 663-675 - Marcelo Campos, Maurício Collares Neto

, Guilherme Oliveira Mota:
Counting orientations of random graphs with no directed k-cycles. 676-691 - Pedro Araújo, Jan Hladký

, Eng Keat Hng
, Matas Sileikis
:
Prominent examples of flip processes. 692-740 - Calum MacRury, Erlang Surya

:
Sharp thresholds in adaptive random graph processes. 741-767 - Svante Janson

:
The number of descendants in a random directed acyclic graph. 768-803
Volume 64, Number 4, July 2024
RESEARCH ARTICLES
- Lutz Warnke

:
Note on down-set thresholds. 807-813 - Sem C. Borst, Frank Den Hollander, Francesca R. Nardi, Matteo Sfragara:

Wireless random-access networks with bipartite interference graphs. 814-855 - Will Perkins, Changji Xu:

Frozen 1-RSB structure of the symmetric Ising perceptron. 856-877 - Alan M. Frieze, Xavier Pérez-Giménez:

Rainbow Hamilton cycles in random geometric graphs. 878-898 - Jacob Fox, Sammy Luo, Huy Tuan Pham

:
On random irregular subgraphs. 899-917 - Mohamed Slim Kammoun

, Mylène Maïda:
Small cycle structure for words in conjugation invariant random permutations. 918-939 - Colin McDiarmid, Sophia Saller:

Random graphs embeddable in order-dependent surfaces. 940-985 - Michael Krivelevich, Tamás Mészáros, Peleg Michaeli

, Clara Shikhelman:
Greedy maximal independent sets via local limits. 986-1015 - Sean Eberhard

:
Dixon's asymptotic without the classification of finite simple groups. 1016-1019

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














