Ramsey proved that for every positive integer $n$, sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is analogue connected graphs: $K_n$, $K_{1,n}$, $P_n$. In this paper, we establish 2-connected graphs. particular, prove exceeding two, one following as subgraph: a subdivision $K_{2,n}$, $K_{2,n}$ with edge between two ve...

Let S0 = 0, {Sn}n≥1 be a random walk generated by a sequence of i.i.d. random variables X1,X2, ... and let τ− := min {n ≥ 1 : Sn ≤ 0} and τ := min {n ≥ 1 : Sn > 0}. Assuming that the distribution of X1 belongs to the domain of attraction of an α-stable law, α 6= 1, we study the asymptotic behavior of P(τ± = n) as n → ∞.

A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...

A graph G is called edge-magic if there exists a bijective function φ : V (G)∪E(G) → {1, 2,. .. , |V (G)|+ |E(G)|} such that φ(x)+φ(xy)+φ(y) is a constant c(φ) for every edge xy ∈ E(G); here c(φ) is called the valence of φ. A graph G is said to be super edge-magic if φ(V (G)) = {1, 2,. .. , |V (G)|}. The super edge-magic deficiency, denoted by μ s (G), is the minimum nonnegative integer n such ...

We introduce lattice models with explicit N=2 supersymmetry. In these interacting models, the supersymmetry generators Q+/- yield the Hamiltonian H=(Q(+),Q(-)) on any graph. The degrees of freedom can be described as either fermions with hard cores, or as quantum dimers; the Hamiltonian of our simplest model contains a hopping term and a repulsive potential. We analyze these models using confor...