Cover Image

Twin-width of sparse random graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hendrey, Kevin, Norin, Sergey, Steiner, Raphael, Turcotte, Jérémie
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nowhere-zero flow reconfiguration
by: Esperet, Louis, et al.
Published: (2025)

Cops and robbers on $P_5$-free graphs
by: Chudnovsky, Maria, et al.
Published: (2023)

Twin-width of random graphs
by: Ahn, Jungho, et al.
Published: (2022)

The Burning Number Conjecture Holds Asymptotically
by: Norin, Sergey, et al.
Published: (2022)

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)

Finding dense minors using average degree
by: Hendrey, Kevin, et al.
Published: (2023)

The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)

Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)

Twin-width of graphs on surfaces
by: Kráľ, Daniel, et al.
Published: (2023)

On an induced version of Menger's theorem
by: Hendrey, Kevin, et al.
Published: (2023)

3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Twin-width of subdivisions of multigraphs
by: Ahn, Jungho, et al.
Published: (2023)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Longest cycles in vertex-transitive and highly connected graphs
by: Groenland, Carla, et al.
Published: (2024)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Cops and robbers on $2K_2$-free graphs
by: Turcotte, Jérémie
Published: (2020)

Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)