Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Borel Combinatorics of Locally Finite Graphs
Oleg Pikhurko
Type:
Preprint
Publication Date:
2020-09-18
Citations:
4
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Borel Combinatorics of Locally Finite Graphs
2020
Oleg Pikhurko
+
On Homomorphism Graphs
2021
Sebastian Brandt
Yi‐Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhoň
Zoltán Vidnyánszky
+
PDF
Chat
Borel combinatorics of locally finite graphs
2021
Oleg Pikhurko
+
PDF
Chat
ON HOMOMORPHISM GRAPHS
2024
Sebastian Brandt
Yi‐Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhoň
Zoltán Vidnyánszky
+
On Homomorphism Graphs.
2021
Sebastian Brandt
Yi‐Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhoň
Zoltán Vidnyánszky
+
Measurable versions of the Lovász Local Lemma and measurable graph colorings
2016
Anton Bernshteyn
+
Measurable versions of the Lov\'{a}sz Local Lemma and measurable graph colorings.
2016
Anton Bernshteyn
+
Measurable versions of the Lovász Local Lemma and measurable graph colorings
2019
Anton Bernshteyn
+
Distributed Algorithms, the Lov\'{a}sz Local Lemma, and Descriptive Combinatorics
2020
Anton Bernshteyn
+
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
2023
Anton Bernshteyn
Felix Weilacher
+
PDF
Chat
Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics
2023
Anton Bernshteyn
+
Distributed Algorithms, the Lovász Local Lemma, and Descriptive Combinatorics
2020
Anton Bernshteyn
+
The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces
2019
Tyler James Arant
+
On Sets and Graphs: Perspectives on Logic and Combinatorics
2017
Eugenio G. Omodeo
Alberto Policriti
Alexandru I. Tomescu
+
PDF
Chat
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms
2023
Anton Bernshteyn
+
PDF
Chat
On Baire measurable colorings of group actions
2020
Anton Bernshteyn
+
Hyperfinite graphings and combinatorial optimization
2017
László Lovász
+
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
2021
Sebastian Brandt
Yi‐Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhoň
Zoltán Vidnyánszky
+
PDF
Chat
Hyperfinite graphings and combinatorial optimization
2020
László Lovász
+
Orienting Borel graphs
2021
Riley Thornton
Works That Cite This (4)
Action
Title
Year
Authors
+
Factor-of-iid balanced orientation of non-amenable graphs
2023
Ferenc Bencs
Aranka Hrušková
László Márton Tóth
+
On Homomorphism Graphs.
2021
Sebastian Brandt
Yi‐Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhoň
Zoltán Vidnyánszky
+
PDF
Chat
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
2021
Jan Grebík
Václav Rozhoň
+
Divisibility of spheres with measurable pieces
2024
Clinton T. Conley
Jan Grebík
Oleg Pikhurko
Works Cited by This (53)
Action
Title
Year
Authors
+
Probability on Trees and Networks
2016
Russell Lyons
Yuval Peres
+
Topics in Orbit Equivalence
2004
Alexander S. Kechris
+
On the existence of a finite invariant measure
1990
M. G. Nadkarni
+
A determinacy approach to Borel combinatorics
2015
Andrew Marks
+
A Course on Borel Sets
1998
S. M. Srivastava
+
A SURVEY OF MEASURED GROUP THEORY
2009
Alex Furman
+
Baire measurable paradoxical decompositions via matchings
2015
Andrew Marks
Spencer Unger
+
PDF
Chat
Banach-Tarski decompositions using sets with the property of Baire
1994
Randall Dougherty
Matthew Foreman
+
Colouring graphs when the number of colours is almost the maximum degree
2014
Michael Molloy
Bruce Reed
+
Decomposition of sets of small or large boundary
1993
Miklós Laczkovich