Hyperfinite graphings and combinatorial optimization

DOI10.1007/s10474-020-01065-yzbMath1474.05336arXiv1709.03179OpenAlexW3038213030MaRDI QIDQ2220974

László Lovász

Publication date: 25 January 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.03179

zbMATH Keywords

greedy algorithmsplitting sethyperfinite graphing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Infinite graphs (05C63) Fractional graph theory, fuzzy graph theory (05C72)

Related Items

Flows on measurable spaces, Uniform hyperfiniteness

Cites Work

• Unnamed Item
• Unnamed Item
• Hyperfinite graph limits
• On limits of finite graphs
• Every minor-closed property of sparse graphs is testable
• Quick approximation to matrices and applications
• On the ratio of optimal integral and fractional covers
• Finite graphs and amenability
• Compact graphings
• Limits of locally-globally convergent graph sequences
• Processes on unimodular random networks
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• On sets of integers containing k elements in arithmetic progression
• Amenability, hyperfiniteness, and isoperimetric inequalities
• Local Graph Partitions for Approximation and Testing
• Efficient testing of large graphs
• Harmonic functions on planar and almost planar graphs and manifolds, via circle packings