Strict inequalities for critical probabilities of a regular graph and a subgraph of it

DOI10.1070/RM1987V042N02ABEH001322zbMATH Open0698.05013OpenAlexW2058268184MaRDI QIDQ3475273

Mikhail Menshikov

Publication date: 1987

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm1987v042n02abeh001322

zbMATH Keywords

percolation problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

Title not available (Why is that?) ⋮ An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Critical subgraphs of a random graph 👍 👎
• On the threshold for \(k\)-regular subgraphs of random graphs 👍 👎
• Quantitative Estimates and Rigorous Inequalities for Critical Points of a Graph and Its Subgraphs 👍 👎
• Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph 👍 👎

This page was built for publication: Strict inequalities for critical probabilities of a regular graph and a subgraph of it

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