6 papers
Graphings with few circulations
Gábor Kun, László Márton Tóth
In 2021, motivated by graph limit theory Lovász extended most of the theory of flows to a measure theoretic setting. Using this framework, the first author constructed -regular…
Skeletons and Spectra: Bernoulli graphings are relatively Ramanujan
Héctor Jardón-Sánchez, László Márton Tóth
The aim of this paper is to investigate the spectral theory of unimodular random graphs and graphings representing them. We prove that Bernoulli graphings are relatively Ramanujan…
Convergent sequences of combinatorial submodular setfunctions
Kristóf Bérczi, Márton Borbényi, László Lovász +1
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other sub…
Quotient-convergence of Submodular Setfunctions
Kristóf Bérczi, Márton Borbényi, László Lovász +1
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids throug…
Cycle Matroids of Graphings: From Convergence to Duality
Kristóf Bérczi, Márton Borbényi, László Lovász +1
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In…
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
Tamás Kátay, László Márton Tóth, Zoltán Vidnyánszky
We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- pres…