The Property of Having a $k$-Regular Subgraph Has a Sharp Threshold

نویسنده

  • Shoham Letzter
چکیده

We prove that the property of containing a k-regular subgraph in the random graph model G(n, p) has a sharp threshold for k ≥ 3. We also show how to use similar methods to obtain an easy prove for the (known fact of) sharpness of having a non empty k-core for k ≥ 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Thresholds of Graph properties and the k sat Problem

Given a monotone graph property P consider p P the proba bility that a random graph with edge probability p will have P The function d p P dp is the key to understanding the threshold behavior of the property P We show that if d p P dp is small corresponding to a non sharp threshold then there is a list of graphs of bounded size such that P can be approximated by the property of having one of t...

متن کامل

On the threshold for k-regular subgraphs of random graphs

The k-core of a graph is the largest subgraph of minimum degree at least k. We show that for k sufficiently large, the (k + 2)-core of a random graph G(n, p) asymptotically almost surely has a spanning k-regular subgraph. Thus the threshold for the appearance of a k-regular subgraph of a random graph is at most the threshold for the (k + 2)-core. In particular, this pins down the point of appea...

متن کامل

Sharp Threshold for Percolation on Expanders

We study the appearance of the giant component in random subgraphs of a given finite graph G = (V, E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c ∈]0, 1[, the property that the random subgraph contains a giant component of size c|V | has a sharp threshold.

متن کامل

Lower bounds on the signed (total) $k$-domination number

Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...

متن کامل

Evaluation of Hearing Threshold in Patients with Beta Thalasemia Major Receiving Regular ChelationTherapy with Desferrioxamine (DFO)

The aim of this study was the evaluation of hearing threshold in patients with beta thalasemia major. For this purpose, 178 patients who were under regular chelation therapy with desferrioxamine (DFO) were selected and underwent ear, nose, throat examinations and audiological evaluations. Patients were between 4 to 25 years old and 54.9% were male and 45.1% were female. Three patients were excl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2013