Size and connectivity of the \(k\)-core of a random graph (Q1179277): Difference between revisions

The \(k\)-core of a graph is the maximal subgraph with no degree below \(k\). Asymptotic estimates are given of the size and connectivity of the \(k\)- core of a Bernoulli graph.

0 references

zbMATH Keywords

connectivity

0 references

random graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

0 references

Q3286850

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Q3778794

0 references

The chromatic number of random graphs at the double-jump threshold

0 references

Identifiers

zbMATH Open document ID

0752.05046

0 references

DOI

10.1016/0012-365X(91)90162-U

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1179277

@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3344024
@@ Property / cites work: Q3344024 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Q3778794
@@ Property / cites work: Q3778794 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs at the double-jump threshold
+Normal rank