Kernels in random graphs

DOI10.1016/0012-365X(90)90327-EMaRDI QIDQ2277494zbMATH OpenFDO

Authors W. Fernandez de la Vega

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90327-E

zbMATH Keywords

kernels in random graphsrandom directed graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80)

Review text

The author establishes the existence of kernels in random graphs. He proves that the random directed graph D(n,p) on n vertices with directed edge probability p possesses a kernel with probability tending to 1 as n tends to \(\infty\).

Recommendations

• Almost all digraphs have a kernel
• scientific article; zbMATH DE number 4212085
• scientific article; zbMATH DE number 3777557
• scientific article; zbMATH DE number 3929034
• On the existence of \(\left[ {k,k + 1} \right]\)-factors in random graphs

Cites work

• Graphes Noyau-Parfaits
• On kernels and semikernels of digraphs

Cited in

(8)

• Coherence in finite argument systems.
• Domination in digraphs
• scientific article; zbMATH DE number 5769858 (Why is no real title available?)
• Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
• Kernels on Graphs as Proximity Measures
• A model for phase transition of random answer-set programs
• On the kernel and related problems in interval digraphs
• Graph theoretical structures in logic programs and default theories

This page was built for publication: Kernels in random graphs

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