Cover Image

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pépin, Martin, Viola, Alfredo
Format:	Preprint
Published:	2023
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

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

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

On acyclic b-chromatic number of cubic graphs
by: Anholcer, Marcin, et al.
Published: (2025)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

Asymptotic normality of pattern counts in random maps II
by: Hainzl, Eva-Maria
Published: (2026)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

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

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

Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)

A characterization of uniquely representable two-directional orthogonal ray graphs
by: Takaoka, Asahi
Published: (2024)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

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)

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

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

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
by: Aboulker, Pierre, et al.
Published: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

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

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Translating between the representations of an acyclic convex geometry of bounded degree
by: Defrain, Oscar, et al.
Published: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

Asymptotic Tightness of the Pigeonhole Bound for Large-Order Davenport-Schinzel Sequences
by: Geneson, Jesse
Published: (2026)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)