5.5k citations
- HUN-REN Alfréd Rényi Institute of MathematicsHU14 papers
- Center for NanoScienceDE8 papers
- Institute for Solid State Physics and OpticsHU8 papers
- Ludwig-Maximilians-Universität MünchenDE8 papers
- Budapest University of Technology and EconomicsHU5 papers
- Eötvös Loránd UniversityHU4 papers
- Harvard UniversityUS3 papers
- Konkoly ObservatoryHU3 papers
- Universität InnsbruckAT3 papers
- University of PisaIT3 papers
- Adam Mickiewicz University in PoznańPL2 papers
- Boston UniversityUS2 papers
4 papers · 1 filter
Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality
Gábor Elek
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associat…
Local chromatic number, Ky Fan's theorem, and circular colorings
Gabor Simonyi, Gabor Tardos
The local chromatic number of a graph was introduced by Erdos et al. in 1986. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local…
The Cover Pebbling Number of Graphs
Betsy Crull, Tammy Cundiff, Paul Feltman +4
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a spec…
Sum-free sets in abelian groups
Ben Green, Imre Z. Ruzsa
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the larges…