output
20022008
most citedSystematic identification of abundant A-to-I editing sites in the human transcriptome

781 citations

Showing 2008 · math.COShow all

8 papers · 2 filters

math.CO2008

High degree graphs contain large-star factors

Noga Alon, Nicholas Wormald

We show that any finite simple graph with minimum degree contains a spanning star forest in which every connected component is of size at least . This sett…

math.CO20081 cited

Economical toric spines via Cheeger's Inequality

Noga Alon, Bo'az Klartag

Let denote the graph whose set of vertices is , where two distinct vertices are adjacent iff they are either equal or adjacent in $C_m…

math.CO20081 cited

Regular induced subgraphs of a random graph

Michael Krivelevich, Benny Sudakov, Nicholas Wormald

An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, w…

math.CO2008

On the random satisfiable process

Michael Krivelevich, Benny Sudakov, Dan Vilenchik

In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas -- randomly permute all 2^k\binom{n}{k} possible clauses over the va…

math.CO2008

Fast winning strategies in Avoider-Enforcer games

Dan Hefetz, Michael Krivelevich, Miloš Stojaković +1

In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\em who} wins but rather {\em how fast} can…

math.CO20081 cited

Hamiltonicity thresholds in Achlioptas processes

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pres…