- Multilinear polynomials and Frankl Ray-Chaudhuri Wilson type
- Increasing the chromatic number of a random graph Benny Sudakov
- Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
- 2-factors in Dense Graphs Eldar Fischer
- Families in Which Disjoint Sets Have Large Union
- Anti-Hadamard matrices, coin weighing, threshold gates and indecomposable hypergraphs
- List coloring of random and pseudo-random graphs Michael Krivelevich
- Constructive bounds for a Ramsey-type problem Michael Krivelevich
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size
- On k-saturated graphs with restrictions on the degrees Ron Holzman
- On (, k)-min-wise independent permutations nogaa@post.tau.ac.il
- Discrete Mathematics 46 (1983) 199-202 199 North-Holland
- Privileged users in zero-error transmission over a noisy channel Eyal Lubetzky
- Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
- JOURNAL OF COMBINATORIAL THEORY 38. 93-94 (1985) Even Edge Colorings of a Graph
- Admission Control to Minimize Rejections and Online Set Cover with Repetitions
- Efficient Simulation of Finite Automata by Neural Nets
- Discrete Kakeya-type problems and small bases Benny Sudakov
- Ramsey Graphs Cannot Be Defined by Real
- Non-averaging subsets and non-vanishing transversals Imre Z. Ruzsa
- Graph Powers The investigation of the asymptotic behaviour of various parameters of powers of a fixed
- COMBINATORICA Akad~miai Kiadd -Springer-Verlag
- Combinatorics, Probability and Computing (1993) 11, 110 Copyright c 1993 Cambridge University Press
- Solving linear systems through nested dissection Raphael Yuster
- Economical Graph Discovery Michal Feldman
- Independence numbers of locally sparse graphs and a Ramsey type problem
- Testing Boolean Function Isomorphism Noga Alon1,
- Balanced Hashing, Color Coding and Approximate Counting (Extended Abstract)
- Hardness of edge-modification problems September 20, 2008
- Piercing Convex Sets and Daniel J. Kleitman
- THE STRUCTURE OF ALMOST ALL GRAPHS IN A HEREDITARY NOGA ALON, JOZSEF BALOGH, BELA BOLLOBAS, AND ROBERT MORRIS
- -discrepancy sets and their applications for interpolation of sparse polynomials
- Economical elimination of cycles in the torus Dedicated to Tom Trotter, for his 65th birthday
- Spectral Techniques in Graph Algorithms The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs
- Graphs and Combinatorics 5, 307-314 (1989) Combinatorics
- Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics
- On a hypergraph matching problem Raphael Yuster
- Sizes of induced subgraphs of Ramsey graphs , Jozsef Balogh
- EXPLICIT UNIQUE-NEIGHBOR EXPANDERS Extended Abstract
- Discrete Mathematics 306 (2006) 10681071 www.elsevier.com/locate/disc
- Tell Me Who I Am: An Interactive Recommendation System
- How to color shift hypergraphs Department of Mathematics
- Expanders, sorting in rounds and superconcentrators of
- Europ . J. Combinatories (1985) 6, 201-203 An Application of Graph Theory to Additive Number Theory
- Graphs and Combinatorics 1, 13-21 (1985) Combinatorics
- JOURNAL OF COMBINATORIAL THEORY, Series A 41, 154-157 (1986) The Number of Small Semispaces
- DiscreteCnmput Geom 1:1-7 (1986) )i,~,n,te ~ (:~mqNJlatk~mJ
- Co~mr~^roRicA 6 (2) (1986) 83--96 EIGENVALUES AND EXPANDERS
- COMBINATOKICA6 (3) (1986) 201--206 COVERING GRAPHS BY THE MINIMUM
- COMaINAXOmCA6 (3) (1986)207--219 EIGENVALUES, GEOMETRIC EXPANDERS,
- TIGHT COMPLEXITY BOUNDS FOR PARALLEL COMPARISON SORTING Department of Mathematics
- Meanders, Ramsey Theory and lower bounds for branching programs Noga Alon+ *
- Discrete Mathematics 60 (1986) 75-90 North-Holland
- JOURNAL OF COMBINATORIAL THEORY, Series A 43, 91-97 (1986) Regular Hypergraphs, Gordon's Lemma,
- Graphs and Combinatorics 2, 95-100 (1986) Combinatorics
- JOURNAL OF ALGORJTHMS 7,567-583 (1986) A Fast and Simple Randomized Parallel Algorithm
- COMBINATOR1CA7 (1) (1987) 1--22 THE MONOTONE CIRCUIT COMPLEXITY
- COMBmA'romcA 7 (2) (1987) 151--160 SMALLEST n-UNIFORM HYPERGRAPH WITH
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES 37, 118-129 (1988) Meanders and Their Applications in
- A Turanlike NeighborhoodCondition and Cliques in Graphs
- An Algorithm for the Detection and Construction of Monge Sequences
- Discrete Comput Geom 4:245-251 (1989) Ih~crete d, C,,ml~llat~mal eometrv"~. 1989 Spr~nger-Verlag New York lnc ~"
- Discrete Applied Mathematics 27 (1990) 25-28 North-Holland
- JOURNAL OF COMBINATORIAL THEORY, %XieS B 47, 114-l 19 (1989) Cycles of Length 0
- Graphs and Combinatorics 4, 303-306 (1988) Combinatorics
- SIAM J. COMPUT. Vol. 18, No. 2, pp. 258-267, April 1989
- ISRAELJOURNALOFMATHEMATICS,Vol.62,No.3,1988 THE LINEAR ARBORICITY OF GRAPHS
- A Linear Time Erasure-Resilient Code With Nearly Optimal Recovery
- Discrete Mathematics 75 (1989) 23-30 North-Holland
- The Maximum Number of Hamiltonian Paths in Tournaments Raymond and Beverly Sackler Faculty of Exact Sciences
- Graphs and Combinatorics 6, 1-4 (1990) Combinatorics
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES 43, 290-298 (1991) A Lower Bound for Radio Broadcast
- Discrete Mathematics 114 (1993) 3-7 North-Holland
- Probabilistic Proofs of Existence of Rare Events Department of Mathematics
- On the Complexity of Radio Communication (Extended Abstract)
- Generalized Sum Graphs Department of Mathematics
- COLORINGS AND ORIENTATIONS OF GRAPHS Departments of Pure Mathematics
- Discrete Mathematics 103 (1992) 111-119 North-Holland
- The strong chromatic number of a graph It is shown that there is an absolute constant c with the following property: For any two
- Generating Pseudo-Random Permutations and Maximum Flow IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120 ,USA
- Single Round Simulation on Radio Networks IBM Almaden Research Center,
- Acyclic Coloring of Graphs Department of Mathematics,Sackler Faculty of Exact Sciences, TelAviv University,
- Simple Constructions of Almost k-wise Independent Random Variables
- A parallel algorithmic version of the Local Lemma. Department of Mathematics
- Economical coverings of sets of lattice points Department of Mathematics
- Almost H-factors in dense graphs and Raphael Yuster
- On three zero-sum Ramsey-type problems Department of Mathematics
- On the Exponent of the All Pairs Shortest Path Problem Department of Mathematics
- Piercing convex sets and the Hadwiger Debrunner (p, q)-problem Department of Mathematics
- POINT SELECTIONS AND WEAK -NETS FOR CONVEX HULLS Department of Mathematics,
- Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling *
- Subdivided graphs have linear Ramsey numbers Bellcore, Morristown, NJ 07960, USA
- Linear Extensions of a Random Partial Order Author(s): Noga Alon, Bela Bollobas, Graham Brightwell, Svante Janson
- Restricted colorings of graphs Department of Mathematics
- The 123 Theorem and its extensions and Raphael Yuster
- Threshold functions for H-factors Department of Mathematics
- Scale-sensitive Dimensions, Uniform Convergence, and Learnability
- Disjoint Systems and Benny Sudakov
- A lattice point problem and additive number theory Noga Alon and Moshe Dubiner
- Tough Ramsey graphs without short cycles AT & T Bell Labs, Murray Hill, NJ 07974, USA
- The acyclic orientation game on random graphs
- A note on network reliability Institute for Advanced Study, Princeton, NJ 08540
- A Lower Bound on the Expected Length of 1-1 Codes Alon Orlitsky
- Adding distinct congruence classes modulo a prime
- Derandomized Graph Products Uriel Feige
- Finding and counting given length cycles Raphael Yuster
- Repeated Communication and Ramsey Graphs Alon Orlitsky
- On Acyclic Colorings of Graphs on Surfaces AT&T Bell Labs
- Explicit Ramsey graphs and orthonormal labelings We describe an explicit construction of triangle-free graphs with no independent sets of size
- Edge-Disjoint Cycles in Regular Directed Graphs Colin McDiarmid
- Approximating the independence number via the -function Nabil Kahale
- H-Factors in Dense Graphs Raphael Yuster
- Disjoint directed cycles It is shown that there exists a positive so that for any integer k, every directed graph with
- Refining the Graph Density Condition for the Existence of Almost Eldar Fischer
- A note on the degree, size and chromatic index of a uniform Jeong Han Kim
- Homomorphisms of Edge-coloured Graphs and Coxeter Groups T. H. Marshall
- Coins with arbitrary weights Dmitry N. Kozlov
- The concentration of the chromatic number of random graphs Michael Krivelevich
- Randomness and Pseudo-Randomness in Discrete Mathematics The discovery, demonstrated in the early work of Paley, Zygmund, Erdos, Kac, Turan, Shannon,
- A note on graph colorings and graph polynomials Michael Tarsi
- Piercing d-intervals A (homogeneous) d-interval is a union of d closed intervals in the line. Using topological meth-
- Combinatorial Nullstellensatz We present a general algebraic technique and discuss some of its numerous applications in
- Linear Hash Functions Martin Dietzfelbinger
- The Shannon Capacity of a union To the memory of Paul Erdos
- Approximation Schemes for Scheduling on Parallel Machines
- Decreasing the Diameter of Bounded Degree Graphs Andras Gyarfas
- Packing Ferrers Shapes Miklos Bona
- Additive Latin Transversals We prove that for every odd prime p, every k p and every two subsets A = {a1, . . . , ak} and
- Regular Languages are Testable with a Constant Number of Queries Michael Krivelevich
- STRING QUARTETS IN BINARY noga@math.tau.ac.il
- Every H-decomposition of Kn has a nearly resolvable alternative Raphael Yuster
- Degrees and choice numbers The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every
- Sparse universal graphs Vera Asodi
- Scalable Secure Storage when Half the System is Faulty Haim Kaplan
- A Ramsey-type problem and the Turan numbers D. S. Gunderson
- On The Complexity of Arrangements of Circles in the Plane
- Algebraic and probabilistic methods in Discrete Mathematics Combinatorics is an essential component of many mathematical areas, and its study has ex-
- On the Maximum Number of Hamiltonian Paths in Tournaments
- Journal of Combinatorial Theory, Series A 91, 5 14 (2000) On a Problem in Shuffling
- Near-optimum Universal Graphs for Graphs with Bounded Degrees
- Testing Satisfiability Asaf Shapira
- Guessing Secrets Efficiently via List Decoding (Extended Abstract)
- NON-REPETITIVE COLORINGS OF GRAPHS NOGA ALON, JAROSLAW GRYTCZUK, MARIUSZ HALUSZCZAK, AND OLIVER
- Voting paradoxes and digraphs realizations A family of permutations F forms a realization of a directed graph T = (V, E) if for every
- Problems and results in Extremal Combinatorics, Part I Extremal Combinatorics is an area in Discrete Mathematics that has developed spectacularly
- Maximum cuts and judicious partitions in graphs without short Bela Bollobas
- Induced subgraphs of prescribed size Michael Krivelevich
- The number of edge colorings with no monochromatic cliques Jozsef Balogh
- Discrete Mathematics: Methods and Challenges Combinatorics is a fundamental mathematical discipline as well as an essential component of
- Smaller Explicit Superconcentrators (Extended Abstract)
- Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
- A simple algorithm for edge-coloring bipartite multigraphs It is well known that the chromatic index of any bipartite multigraph G with n vertices and m
- The Online Set Cover Problem Baruch Awerbuch
- Regular graphs whose subgraphs tend to be acyclic Eitan Bachmat
- Testing Low-Degree Polynomials over GF(2) Tali Kaufman
- Learning a Hidden Subgraph Vera Asodi
- Dense graphs are antimagic Y. Roditty
- Graph Products, Fourier Analysis and Spectral Techniques Irit Dinur
- MaxCut in H-free graphs Michael Krivelevich
- Linear Equations, Arithmetic Progressions and Hypergraph Property Testing
- Algorithmic Construction of Sets for k-Restrictions Dana Moshkovitz
- Problems and results in Extremal Combinatorics-II Dedicated to Miki Simonovits, for his 60th-birthday
- MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMAL VALUES
- Crossing Patterns of Semi-algebraic Sets Janos Pach
- Feasible schedules for rotating transmissions Motivated by a scheduling problem that arises in the study of optical networks we prove
- Estimating arbitrary subset sums with few probes Nick Duffield
- Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
- A Separation Theorem in Property Testing Asaf Shapira
- Embedding nearly-spanning bounded degree trees Michael Krivelevich
- Testing of bipartite graph properties Eldar Fischer
- A Characterization of the (natural) Graph Properties Testable with One-Sided Error
- Additive Approximation for Edge-Deletion Problems Asaf Shapira
- Homomorphisms in Graph Property Testing -A Survey Dedicated to Jaroslav Nesetril on the occasion of his 60th
- Independent sets in tensor graph powers Eyal Lubetzky
- The Grothendieck constant of random and pseudo-random graphs To the memory of George Dantzig
- Graph powers, Delsarte, Hoffman, Ramsey and Shannon Eyal Lubetzky
- PROBLEM SECTION Splitting digraphs
- Uniformly cross intersecting families Eyal Lubetzky
- Parameterized Algorithms for Directed Maximum Leaf Problems
- Poker, Chance and Skill 1 Introduction
- Fast algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in graphs with a (not so) small vertex cover
- Finding disjoint paths in expanders deterministically and online Michael Capalbo
- Weak -nets and interval chains Noga Alon, Haim Kaplan, Gabriel Nivasch1
- Stability type results for hereditary properties November 12, 2007
- Cleaning d-regular graphs with brushes Pawel Pralat
- Optimal Monotone Encodings Moran, Naor and Segev have asked what is the minimal r = r(n, k) for which there exists
- Small sample spaces cannot fool low degree polynomials Ido Ben-Eliezer
- The Complexity of the Outer Face in Arrangements of Random Segments
- BIOINFORMATICS Vol. 00 no. 00 2008
- The maximum number of perfect matchings in graphs with a given degree sequence
- Splitting necklaces and measurable colorings of the real line Noga Alon, Jaroslaw Grytczuk, Michal Lason, and Mateusz Michalek
- On the power of two, three and four probes Uriel Feige
- CHOICE-MEMORY TRADEOFF IN ALLOCATIONS NOGA ALON, ORI GUREL-GUREVICH, AND EYAL LUBETZKY
- Economical toric spines via Cheeger's Inequality Bo'az Klartag
- Typical Peak Sidelobe Level of Binary Sequences Noga Alon, Simon Litsyn, and Alexander Shpunt
- A note on regular Ramsey graphs Sonny Ben-Shimon
- Basic Network Creation Games Schools of Mathematics &
- Sum of Us: Strategyproof Selection from the Selectors Noga Alon Felix Fischer Ariel D. Procaccia Moshe Tennenholtz
- Another abstraction of the Erdos-Szekeres Happy End Theorem
- SUMS AND PRODUCTS ALONG SPARSE GRAPHS NOGA ALON, OMER ANGEL, ITAI BENJAMINI, AND EYAL LUBETZKY
- Adversarial Leakage in Games Michal Feldman
- Solving MAX-r-SAT above a Tight Lower Bound , Gregory Gutin2
- Universality, tolerance, chaos and order Dedicated to Endre Szemeredi, for his 70th birthday
- A non-linear lower bound for planar epsilon-nets We show that the minimum possible size of an -net for point objects and line (or rectangle)-
- Walking in Circles Michal Feldman
- Hypergraph list coloring and Euclidean Ramsey Theory Alexandr Kostochka
- The de Bruijn-Erdos Theorem for Hypergraphs
- On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game
- Multicolored matchings in hypergraphs For a collection of (not necessarily distinct) matchings M = (M1, M2, . . . , Mq) in a hypergraph,
- A note on degenerate and spectrally degenerate graphs A graph G is called spectrally d-degenerate if the largest eigenvalue of each subgraph of it with
- PARTITIONING INTO GRAPHS WITH ONLY SMALL , GUOLI DING2
- Lower Bounds for Approximations by Low Degree Polynomials Over Tel Aviv University
- Large sets in finite fields are sumsets For a prime p, a subset S of Zp is a sumset if S = A+A for some A Zp. Let f(p) denote the
- The number of sumsets in a finite field Andrew Granville
- Percolation on finite graphs and isoperimetric inequalities Itai Benjamini
- On-line and Off-line Approximation Algorithms for Vector Covering Problems
- Degrees of Freedom Versus Dimension for Containment Orders Department of Mathematics
- Graphs and Combinatorics 1,305-310 (1985) Combinatorics
- Coloring graphs with sparse neighborhoods Michael Krivelevich
- On constant time approximation of parameters of bounded degree graphs
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- Polychromatic Colorings of Plane Graphs Robert Berke
- Discrete Comput Geom 4:239-243 (1989) C [h.,'rvte~COntlmtala~4tal Jeometrv~. 1989 Sprmger-Vedag New York In
- Induced subgraphs with distinct sizes A.V. Kostochka
- High degree graphs contain large-star factors Dedicated to Laszlo Lovasz, for his 60th birthday
- Witnesses for Boolean Matrix Multiplication and for Shortest Paths Oded Margalit
- Many Random Walks Are Faster Than One Tel Aviv University
- On two segmentation problems Benny Sudakov
- The Number of Spanning Trees in Regular Graphs
- Dense uniform hypergraphs have high list chromatic number and Alexandr Kostochka
- The Borsuk-Ulam Theorem and Bisection of Necklaces Author(s): Noga Alon and Douglas B. West
- Vertex Transversals that Dominate
- Balanced Families of Perfect Hash Functions and Their Applications
- Equilateral sets in ln Pavel Pudlak
- Sparse balanced partitions and the complexity of subgraph Daniel Marx
- JOURNAL OF COMBINATORIAL THEORY, Series B 47, 153-161 (1989) Combinatorial Reconstruction Problems
- Probabilistic Methods in Extremal Finite Set Theory Department of Mathematics
- Testing subgraphs in large graphs Let H be a fixed graph with h vertices, let G be a
- Fault tolerant graphs, perfect hash functions and disjoint paths E. Szemeredi
- Acta Math. Hung; 57 (1---2) (1991),61--64~
- Partitioning multi-dimensional sets in a small number of "uniform" parts
- Testing Triangle-Freeness in General Graphs Tali Kaufman
- The inverse Banzhaf problem Paul H. Edelman
- A Biological Solution to a Fundamental Distributed Computing Problem
- Playing to retain the advantage Dan Hefetz
- A Note on Competitive Diffusion Through Social Networks Michal Feldman
- Modular orientations of random and quasi-random regular graphs Pawel Pralat
- Discrete ComputGeom4:287-290(1989) tG989Discrete&Cq~nputati,.ml
- Approximation Schemes for Scheduling on Parallel Machines
- UNIVERSALITY AND TOLERANCE (Extended Abstract)
- Learning a Hidden Matching Combinatorial Identification of Hidden Matchings with Applications to Whole Genome Sequencing
- Derandomization via small sample spaces School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact
- The Geometry of Coin-Weighing Problems (Extended Abstract)
- Bipartite subgraphs (Final Version; appeared in Combinatorica 16 (1996), 301-311.)
- PARTITIONING AND GEOMETRIC EMBBDDING OF RANGE SPACES OF FINITE VAPNIK-CHBRVONBNKIS DIMENSION
- Norm-graphs: variations and applications Noga Alon 1
- A parallel algorithmic version of the Local Lemma Department of Mathematics
- Properly colored Hamilton cycles in edge colored complete graphs Dedicated to the memory of Paul Erdos
- A Separator Theorem for Graphs with an Excluded Minor and its Applications
- Separable Partitions Shmuel Onn
- Large nearly regular induced subgraphs Michael Krivelevich
- On the concentration of eigenvalues of random symmetric matrices Michael Krivelevich
- Superconcentrators of depth 2 and 3; odd levels help (rarely) Bellcore, Morristown, NJ, 07960, USA
- Non-constructive proofs in Combinatorics Department of Mathematics
- H-free graphs of large minimum degree Benny Sudakov
- Bayesian Ignorance Michal Feldman
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- T-choosability in graphs Noga Alon 1
- Finding a large hidden clique in a random graph Michael Krivelevich
- Linear arboricity and linear k-arboricity of regular graphs V. J. Teague
- Covering the edges of a graph by a prescribed tree with minimum Raphael Yuster
- Extremal and Probabilistic Combinatorics
- GEOMETRICAL REALIZATION OF SET SYSTEMS AND PROBABILISTIC C01vf1v1UNICATION COMPLEXITY
- Approximate Maximum Parsimony and Ancestral Maximum Likelihood
- On an anti-Ramsey type result , Hanno Lefmann
- Improved Approximation for Directed Cut Problems Amit Agarwal
- JOURNAL OF COMBINATORIAL THEORY, Series A 57, 203-210 (1991) Additive Bases of Vector Spaces over Prime Fields
- Testing k-colorability Michael Krivelevich
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Discrete Applied North-Holland
- ISRAEL IOURNAL OF MATHEMATICS, Vol. 53, No. 1, 1986 ON THE NUMBER OF CERTAIN SUBGRAPHS
- Combinatorial Reasoning in Information Theory Combinatorial techniques play a crucial role in the investigation of problems in Informa-
- Graphs and Combinatorics 7, 1-6 (1991) Combinatorics
- Breaking the rhythm on graphs Noga Alon and Jaroslaw Grytczuk
- New bounds on parent-identifying codes: The case of multiple parents
- The Longest Cycle of a Graph with a Large
- Set systems with no union of cardinality 0 modulo N. Alon, IBM Almaden and Tel Aviv University
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- On Partitions of Discrete Boxes Ron Holzman
- Strategyproof Approximation of the Minimax on Networks Michal Feldman
- Testing k-wise and Almost k-wise Independence Tel Aviv University
- Extremal Problems Transformations of
- JOURNAL OF COMBINATORIAL THEORY, Series A 52, 275-287 (1989) Ascending Waves
- Coin-flipping games immune against linear-sized coalitions Tel Aviv University
- Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs
- Subgraphs with a Large Cochromatic Number Michael Krivelevich
- Poisson approximation for non-backtracking random walks Eyal Lubetzky
- The space complexity of approximating the frequency moments Yossi Matias
- Ramsey-type theorems with forbidden subgraphs
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
- On graphs with subgraphs having large independence numbers Benny Sudakov
- Bounding the piercing number It is shown that for every k and every p q d + 1 there is a c = c(k, p, q, d) < such
- Tracing Many Users With Almost No Rate Penalty Vera Asodi
- Large induced forests in sparse graphs , Dhruv Mubayi
- The Shannon capacity of a graph and the independence numbers of Eyal Lubetzky
- Codes and Xor graph products Eyal Lubetzky
- Sure monochromatic subset sums Paul Erdos
- Choosability and fractional chromatic numbers This copy was printed on October 11, 1995
- Quadratic Forms on Graphs Konstantin Makarychev
- Improved parallel approximation of a class of integer programming problems
- The Algorithmic Aspects of the Regularity Lemma R. A. Duke
- Turan's theorem in the hypercube Anja Krech
- Random Sampling and Approximation of MAX-CSP Problems Department of Mathematics
- Coin-flipping games immune against linear-sized coalitions (Extended abstract)
- Packing and Covering Dense Graphs Raphael Yuster
- Economical covers with geometric applications Bela Bollobas
- Graphs and Combinatorics 3, 91-94 (1987) Combinatorics
- Algorithms with large domination ratio Gregory Gutin
- Economical toric spines via Cheeger's Inequality Bo'az Klartag
- Hypergraph list coloring and Euclidean Ramsey Theory Alexandr Kostochka
- Akad~mialKiad5-Springer-Verlag COMBINATORICA 11 (2) (1991)97-122
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Multicolored Forests in Bipartite Decompositions of Graphs IBM Almaden Research Center, San Jose, CA 95120
- Semi-direct product in groups and Zig-zag product in graphs
- TOOLS FROM HIGHER ALGEBRA Department of Mathematics
- Graphs and Combinatorics 1,387-389 (1985) Research Problems
- Discrepancy games Michael Krivelevich
- Unextendible Product Bases L. Lovasz
- LOCALLY THIN SET FAMILIES noga@math.tau.ac.il
- Acta Math.Hung. 49 (1---2)(1987),163---167.
- A Characterization of Easily Testable Induced Subgraphs Asaf Shapira
- Brief Announcement: Sharing Memory in a Self-stabilizing Manner
- Discrete Mathematics 58 (1986) 191-193 North-Holland
- Spanning subgraphs of Random Graphs (A research problem)
- A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjecture
- On Sunflowers and Matrix Multiplication Amir Shpilka
- SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics Vol. 24, No. 3, pp. 892894
- Dense uniform hypergraphs have high list chromatic number and Alexandr Kostochka
- Perfect matchings in -regular graphs School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540
- Packing of partial designs Bellcore, Morristown, NJ 07960, USA
- What is the furthest graph from a hereditary property? For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the
- An Elementary Construction of Constant-Degree Expanders Oded Schwartz
- On Graphs and Algebraic Graphs that do not Contain Cycles of Length 4
- Every Monotone Graph Property is Testable Asaf Shapira
- A General Approach to Online Network Optimization Problems Baruch Awerbuch
- Maximum directed cuts in acyclic digraphs Bela Bollobas
- Combinatorics, Probability and Computing (1993) 11, 110 Copyright c 1993 Cambridge University Press
- Resolution enhancement in MRI Eyal Carmia,T, Siuyan Liub
- Progressions in Sequences of Nearly Consecutive Integers For k > 2 and r 2, let G(k, r) denote the smallest positive integer g such that every increasing
- The Moore bound for irregular graphs Shlomo Hoory
- ISRAELJOURNALOFMATHEMATICS,Vol.38,Nos.1-2,1981 ON THE NUMBER OF SUBGRAPHS
- Optimal Universal Graphs with Deterministic Embedding Michael Capalbo
- Order4(1987), 155-164. 0 1987 by D. Reidel Publishing Company
- JOURNAL OF NUMBER THEORY 27. 196-205 (1987) Subset Sums
- Graphs and Combinatorics 3, 203-211 (1987) Combinatorics
- JOURNAL OF COMBINATORIAL THEORY, Series B 37, 79-91 (1984) Regular Subgraphs of Almost Regular Graphs
- Acyclic Edge Colorings of Graphs Benny Sudakov
- Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary
- Large sets of nearly orthogonal vectors Mario Szegedy
- Tracing a single user Vera Asodi
- Spanning directed trees with many leaves , Fedor V. Fomin2
- A Characterization of the (natural) Graph Properties Testable with One-Sided Error
- A non-linear lower bound for planar epsilon-nets We show that the minimum possible size of an -net for point objects and line (or rectangle)-
- The Brunn-Minkowski Inequality and nontrivial cycles in the discrete torus
- ON THE DISCREPANCY OF COMBINATORIAL RECTANGLES
- Long cycles in critical graphs Michael Krivelevich
- Transversal Numbers for Hypergraphs Arising in School of Mathematics
- Non-backtracking random walks mix faster Itai Benjamini
- Ranking tournaments A tournament is an oriented complete graph. The feedback arc set problem for tournaments is
- On an Extremal Hypergraph Problem of Brown, Erdos and Sos Asaf Shapira
- On the Capacity of Digraphs For a digraph G = (V, E) let w(Gn
- Bipartite Subgraphs of Integer Weighted Graphs Eran Halperin
- Comparison-Sorting and Selecting in Totally Monotone Matrices
- The maximum edit distance from hereditary graph properties September 21, 2007
- Parent-identifying codes Eldar Fischer
- On-line Steiner Trees in the Euclidean Plane Yossi Azar
- Disjoint Simplices and Geometric Hypergraphs
- COMBINAIORICA Akad6miai Kiad6 ~ Springer-Verlag
- Approximating the Cut-Norm via Grothendieck's Inequality Assaf Naor
- Packings with large minimum kissing numbers For each proper power of 4, n, we describe a simple explicit construction of a finite collection
- Efficient testing of large graphs Eldar Fischer
- Nearly perfect matchings in regular simple hypergraphs Jeong-Han Kim
- Subgraphs of Large Connectivity and
- Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
- The number of orientations having no fixed tournament Raphael Yuster
- Covering a hypergraph of subgraphs Dedicated to Dan Kleitman, for his 65th-birthday.
- Acta Math. Hung. 42 (3----4)(1983), 221--223.
- Balancing Sets of Vectors Department of Mathematics
- On the Number of Permutations Avoiding a Given Ehud Friedgut
- Linear Time Erasure Codes With Nearly Optimal Recovery (Extended Abstract)
- Short certificates for tournaments Miklos Ruszinko
- Asymptotically tight bounds for some multicolored Ramsey Vojtech Rodl
- Long non-crossing configurations in the plane (Draft) Subhash Suri
- Neighborly families of boxes and bipartite coverings Dedicated to Professor Paul Erdos on the occasion of his 80th
- Edge Coloring with Delays Vera Asodi
- Annals of Combinatorics 2 (1998) **-** The Choice Number of Random Bipartite Graphs
- A spectral technique for coloring random 3-colorable graphs Nabil Kahale
- Graphs and Combinatorics 5, 95-106 (1989) Combinatorics
- Geometric and Functional Analysis Vol. 2, No. 1 (1992)
- An Asymptotic Isoperimetric Inequality Ravi Boppana
- COMBINATORICA Akad~miai Kind6 ~ Springer-Verlag
- Graphs with Integral Spectrum Omran Ahmadi
- Choice numbers of graphs; a probabilistic approach Department of Mathematics
- Almost k-wise independence versus k-wise independence Sackler Faculty of Exact Sciences
- The polynomial method and restricted sums of congruence classes Melvyn B. Nathanson
- Polynomial time randomised approximation schemes for Tutte-Grothendieck invariants: the dense case
- Zero-sum sets of prescribed size Noga Alon and Moshe Dubiner
- Reflection Sequences Author(s): N. Alon, I. Krasikov, Y. Peres
- A Ramsey-type result for the hypercube Rados Radoicic
- FACTOR d-DOMATIC COLORINGS OF GRAPHS NOGA ALON, GUILLAUME FERTIN, ARTHUR L. LIESTMAN, THOMAS C. SHERMER,
- MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: TYPICAL VALUES
- ACYCLIC MATCHINGS NOGA ALON, C. KENNETH FAN, DANIEL KLEITMAN, AND JOZSEF LOSONCZY
- Broadcasting with side information Avinatan Hassidim
- Conflict-Free colorings of Shallow Discs Shakhar Smorodinsky
- JOURNAL OF COMBINATORIAL THEORY, Series A 40, 82-89 (1985) An Extremal Problem for Sets with
- Matching nuts and bolts (Extended Abstract)
- Probabilistic Methods in Coloring and Decomposition Problems Department of Mathematics
- Sparse Universal Graphs for Bounded-Degree Graphs Michael Capalbo
- Constructive lower bounds for off-diagonal Ramsey numbers Pavel Pudlak
- The Chromatic Number of Kneser Hypergraphs Author(s): N. Alon, P. Frankl, L. Lovsz
- UNCORRECTED DISC: 7262 + Model pp. 111 (col. fig: NIL)
- EIGENVALUES, EXPANDERS AND SUPERCONCENTRATORS (Extended Abstract)
- An Application of Set Theory to Coding Theory Author(s): Noga Alon and Andy Liu
- A Separator Theorem for Nonplanar Graphs Author(s): Noga Alon, Paul Seymour, Robin Thomas
- The de Bruijn-Erdos Theorem for Hypergraphs
- Daniel Lokshtanov2 Saket Saurabh2
- The number of F-matchings in almost every tree is a zero residue Simi Haber
- Combinatorics, Probability and Computing (1993) 11, 110 Copyright c 1993 Cambridge University Press
- On a problem of Erdos and Turan and some related results Mihail N. Kolountzakis
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Perturbed identity matrices have high rank: proof and applications We describe a lower bound for the rank of any real matrix in which all diagonal entries are
- Approximate Hypergraph Coloring Noga Alon 1 Pierre Kelsen 2 Sanjeev Mahajan 3 Hariharan Ramesh 4
- Can a Graph Have Distinct Regular Partitions? Asaf Shapira
- Algorithmic Aspects of Acyclic Edge Colorings A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle
- Construction of Asymptotically Good Low-Rate Error-Correcting Codes through
- k-Wise Independent Random Graphs Schools of Mathematics and Computer Science,
- Equireplicate Balanced Binary Codes for Oligo Arrays Mathematics
- Hardness of Fully Dense Problems July 7, 2005
- Random Cayley Graphs and Expanders Yuval Roichman
- Nonnegative k-sums, fractional covers, and probability of small Benny Sudakov
- Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
- QUASI-RANDOMNESS AND ALGORITHMIC REGULARITY FOR GRAPHS WITH GENERAL DEGREE DISTRIBUTIONS
- Local Correction of Juntas Sackler School of Mathematics and Blavatnik School of Computer Science, Tel Aviv
- Space-efficient Local Computation Algorithms Ronitt Rubinfeld
- Nonnegative k-sums, fractional covers, and probability of small Benny Sudakov
- Testing perfection is hard A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for
- Local Rainbow Colorings Ido Ben-Eliezer
- Beeping a Maximal Independent Set Yehuda Afek1
- Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications