Acyclic orientations of random graphs (Q1271856): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q172385
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1006/aama.1998.0595 / rank
Normal rank
 
Property / author
 
Property / author: Christian M. Reidys / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/aama.1998.0595 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092274915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest random component of a k-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of computer simulation. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Randomized Algorithms for Local Sorting and Set-Maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Bounds Are Weak in the Shortest Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/AAMA.1998.0595 / rank
 
Normal rank

Latest revision as of 17:12, 10 December 2024

scientific article
Language Label Description Also known as
English
Acyclic orientations of random graphs
scientific article

    Statements

    Acyclic orientations of random graphs (English)
    0 references
    11 November 1998
    0 references
    A Bernoulli subgraph of an undirected graph is a random subgraph obtained by independently keeping edges with a common probability. The distribution of the number of acyclic orientations is studied for a Bernoulli subgraph of a complete graph of order \(n\) and for a Bernoulli subgraph of an \(n\)-cube.
    0 references
    number of acyclic orientations
    0 references
    Bernoulli subgraph
    0 references

    Identifiers