The Structure of Random Graph Orders

DOI10.1137/S0895480194281215zbMATH Open0869.06001OpenAlexW1967533964MaRDI QIDQ4337738FDOQ4337738

Béla Bollobás, Graham Brightwell

Publication date: 26 May 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194281215

zbMATH Keywords

decompositionrandom graphrandom variablespartial orderheightlinear extensionsrandom partial orderincomparable pairsposts

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorics of partially ordered sets (06A07)

Cited In (11)

• Random partial orders, posts, and the causal set approach to discrete quantum gravity
• Title not available (Why is that?)
• Evaluating topological ordering in directed acyclic graphs
• On retracts of the random graph and their natural order
• Continuum limits for classical sequential growth models
• The 42 reducts of the random ordered graph
• Searching in random partially ordered sets
• Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
• On tail distribution of interpost distance
• Convergence of directed random graphs to the Poisson-weighted infinite tree
• Parallel execution of schedules with random dependency graph

This page was built for publication: The Structure of Random Graph Orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337738)