Hyperfinite graphings and combinatorial optimization
Author:
Open Access
- 30 June 2020
- journal article
- research article
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 161 (2) , 516-539
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Limits of locally–globally convergent graph sequencesGeometric and Functional Analysis, 2014
- Finite graphs and amenabilityJournal of Functional Analysis, 2012
- Szemerédi's Regularity Lemma for Matrices and Sparse GraphsCombinatorics, Probability and Computing, 2011
- Every minor-closed property of sparse graphs is testableAdvances in Mathematics, 2010
- Note on limits of finite graphsCombinatorica, 2007
- Processes on Unimodular Random NetworksElectronic Journal of Probability, 2007
- Efficient Testing of Large GraphsCombinatorica, 2000
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- Harmonic functions on planar and almost planar graphs and manifolds, via circle packingsInventiones Mathematicae, 1996
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975