Search Results - "Alon, Noga"

Explicit Expanders of Every Degree and Size by Alon, Noga

“…An ( n, d , λ)-graph is a d regular graph on n vertices in which the absolute value of any nontrivial eigenvalue is at most λ. For any constant d ≥ 3, ϵ > 0…”
Get full text

Connectivity graph‐codes by Alon, Noga

“…The symmetric difference of two graphs G1,G2$$ {G}_1,{G}_2 $$ on the same set of vertices V$$ V $$ is the graph on V$$ V $$ whose set of edges are all edges…”
Get full text

Spanning trees with few non-leaves by Alon, Noga

“…Let f ( n, k ) denote the smallest number so that every connected graph with n vertices and minimum degree at least k contains a spanning tree in which the…”
Get full text

Asymptotically optimal induced universal graphs by Alon, Noga

“…We prove that the minimum number of vertices of a graph that contains every graph on k vertices as an induced subgraph is ( 1 + o ( 1 ) ) 2 ( k - 1 ) / 2 …”
Get full text

Hitting a Prime in 2.43 Dice Rolls (On Average) by Alon, Noga, Malinovsky, Yaakov

“…What is the number of rolls of fair six-sided dice until the first time the total sum of all rolls is a prime? We compute the expectation and the variance of…”
Get full text

List-Decodable Zero-Rate Codes by Alon, Noga, Bukh, Boris, Polyanskiy, Yury

“…We consider list decoding in the zero-rate regime for two cases-the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the…”
Get full text

Divisible subdivisions by Alon, Noga, Krivelevich, Michael

“…We prove that for every graph H of maximum degree at most 3 and for every positive integer q there is a finite f = f ( H , q ) such that every K f‐minor…”
Get full text

Near-sunflowers and focal families by Alon, Noga, Holzman, Ron

“…We present some problems and results about variants of sunflowers in families of sets. In particular, we improve an upper bound of the first author, Körner and…”
Get full text

Logarithmically larger deletion codes of all distances by Alon, Noga, Bourla, Gabriela, Graham, Ben, He, Xiaoyu, Kravitz, Noah

“…The deletion distance between two binary words u , v ∈ {0, 1} n is the smallest k such that u and v share a common subsequence of length n - k . A set C of…”
Get full text

Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles by Alon, Noga, Pokrovskiy, Alexey, Sudakov, Benny

“…A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly…”
Get full text

Additive Approximation of Generalized Turán Questions by Alon, Noga, Shikhelman, Clara

“…For graphs G and T , and a family of graphs F let ex ( G , T , F ) denote the maximum possible number of copies of T in an F -free subgraph of G . We…”
Get full text

Complete minors and average degree: A short proof by Alon, Noga, Krivelevich, Michael, Sudakov, Benny

“…We provide a short and self‐contained proof of the classical result of Kostochka and of Thomason, ensuring that every graph of average degree d $d$ has a…”
Get full text

Testing Equality in Communication Graphs by Alon, Noga, Efremenko, Klim, Sudakov, Benny

“…Let G = (V, E) be a connected undirected graph with k vertices. Suppose that on each vertex of the graph there is a player having an n-bit string. Each player…”
Get full text

Biomolecular network motif counting and discovery by color coding by Alon, Noga, Dao, Phuong, Hajirasouliha, Iman, Hormozdiari, Fereydoun, Sahinalp, S. Cenk

“…Protein–protein interaction (PPI) networks of many organisms share global topological features such as degree distribution, k-hop reachability, betweenness and…”
Get full text

Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits by Alon, Noga, Kumar, Mrinal, Volk, Ben Lee

“…We prove a lower bound of Ω ( n 2 /log 2 n ) on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial f (…”
Get full text

Clique coloring of dense random graphs by Alon, Noga, Krivelevich, Michael

“…The clique chromatic number of a graph G=(V,E) is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is…”
Get full text

High-girth near-Ramanujan graphs with localized eigenvectors by Alon, Noga, Ganguly, Shirshendu, Srivastava, Nikhil

“…We show that for every prime d and α ∈ (0, 1/6), there is an infinite sequence of ( d + 1)-regular graphs G = ( V, E ) with high girth Ω(α log d (∣ V ∣),…”
Get full text

Biological Solution to a Fundamental Distributed Computing Problem by Afek, Yehuda, Alon, Noga, Barad, Omer, Hornstein, Eran, Barkai, Naama, Bar-Joseph, Ziv

“…Computational and biological systems are often distributed so that processors (cells) jointly solve a task, without any of them receiving all inputs or…”
Get full text

Duplication Distance to the Root for Binary Sequences by Alon, Noga, Bruck, Jehoshua, Farnoud Hassanzadeh, Farzad, Jain, Siddharth

“…We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication…”
Get full text

Efficient Removal Lemmas for Matrices by Alon, Noga, Ben-Eliezer, Omri

“…It was recently proved in Alon et al. ( 2017 ) that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a…”
Get full text