We present a direct and fairly simple proof of the following incidence bound: Let P be a set of m points and L a set of n lines in R, for d ≥ 3, which lie in a common algebraic two-dimensional surface of degree D that does not contain any 2-flat, so that no 2-flat contains more than s ≤ D lines of L. Then the number of incidences between P and L is

For a given simple graph G = (V,E), we define an incidence as a pair (v, e), where vertex v ∈ V (G) is one of the ends of edge e ∈ E(G). Let us define a set of incidences I(G) = {(v, e) : v ∈ V (G)∧ e ∈ E(G)∧ v ∈ e}. We say that two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, e 6= f , (ii) e = f , v 6= w, (iii) e = {v, w}, f = {w, u} and v 6= u. By an inc...

With a nite graph G V E we associate a partially ordered set P X P with X V E and x e in P if and only if x is an endpoint of e in G This poset is called the incidence poset of G In this paper we consider the function M p d de ned for p d as the maximum number of edges a graph G can have when it has p vertices and the dimension of its incidence poset is at most d It is easy to see that M p p as...

An incidence of a graph G is a pair (v, e) where v is a vertex of G and e an edge incident to v. Two incidences (v, e) and (w, f) are adjacent whenever v = w, or e = f , or vw = e or f . The incidence coloring game [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980–1987] is a variation of the ordinary coloring game where the two players, Alice and Bob, alte...

The incidence coloring game has been introduced in [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980– 1987] as a variation of the ordinary coloring game. The incidence game chromatic number ιg(G) of a graph G is the minimum number of colors for which Alice has a winning strategy when playing the incidence coloring game on G. In [C. Charpentier and É. Sopen...

An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama et al. [...

Background: In Iran, methadone has been used for methadone maintenance treatment (MMT) as well as analgesic treatment in pain clinics. Recently, there are some reports regarding accidental and intentional methadone poisonings and deaths. The aim of this study was to evaluate the trend of methadone poisonings and deaths during a 10-year period in Tehran, Iran. Methods: This was a retrospective c...

We prove that the number of incidences between m points and n bounded-degree curves with k degrees of freedom in Rd is O m k dk−d+1n dk−d dk−d+1 + d−1 ∑ j=2 m k jk−j+1n d(j−1)(k−1) (d−1)(jk−j+1) q (d−j)(k−1) (d−1)(jk−j+1) j + m + n  , for any ε > 0, where the constant of proportionality depends on k, ε and d, provided that no j-dimensional surface of degree 6 cj(k, d, ε), a constant paramete...

conclusions ptsd from childbirth occurs in some women. early identification of risk factors should lead to early therapeutic intervention in the mothers at risk of ptsd. results one hundred and three (17. 2%) women had symptoms of ptsd following childbirth based on the ptsd symptom scale (pss). the results of logistic regression analysis revealed a significant correlation between maternal occup...

background: retinoblastoma is the most common embryonic tumor of retina of children. this tumor include 3-4% of all children malignancies during the age range 0-14 years. in this study, we reported the incidence, therapeutic protocols, and treatment outcome of children with rb in south west iran. methods: we retrospectively investigated the medical reports clinical and pathological features of ...