Cover Image

Borel line graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anderson, James, Bernshteyn, Anton
Format:	Preprint
Published:	2023
Subjects:	Logic Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Large-scale geometry of Borel graphs of polynomial growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Embedding Borel graphs into grids of asymptotically optimal dimension
by: Bernshteyn, Anton, et al.
Published: (2024)

Borel Local Lemma: arbitrary random variables and limited exponential growth
by: Bernshteyn, Anton, et al.
Published: (2024)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
by: Bernshteyn, Anton, et al.
Published: (2023)

Borel Vizing's Theorem for Graphs of Subexponential Growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Borel fractional perfect matchings in quasi-transitive amenable graphs
by: Murray, Sam
Published: (2025)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Borel Order Dimension
by: Raghavan, Dilip, et al.
Published: (2024)

Coloring graphs with forbidden almost bipartite subgraphs
by: Anderson, James, et al.
Published: (2022)

Borel sets of Rado graphs and Ramsey's Theorem
by: Dobrinen, Natasha
Published: (2019)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

LCLs in the Borel Hierarchy
by: Weilacher, Felix
Published: (2026)

The ineffectiveness of the regularity lemma for bounded degree graphs
by: Lyons, Clark, et al.
Published: (2025)

The Borel Ramsey properties for countable Borel equivalence relations
by: Gao, Su, et al.
Published: (2024)

Local and global $d$-rigidity are not definable in the first order logic of graphs
by: Bernstein, Daniel Irving, et al.
Published: (2025)

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
by: Fu, Yayi
Published: (2023)

Flows with minimal subdynamics
by: Bernshteyn, Anton, et al.
Published: (2025)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

A logical limit law for the sequential model of preferential attachment graphs
by: Özdemir, Alperen
Published: (2024)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Borel Polychromatic Number of Grids
by: Berlow, Katalin, et al.
Published: (2025)

Labelled growth rates of $ω$-categorical structures and applications in choiceless set theory
by: Bodor, Bertalan, et al.
Published: (2025)

Geometric duality, perfect graphs, and the Sierpiński space
by: Borodulin-Nadzieja, Piotr, et al.
Published: (2026)

Omission of Intervals: Deducing covering properties of subsets of the real line from their combinatorial structure
by: Tsaban, Boaz
Published: (2024)

Partitioning the real line into Borel sets
by: Brian, Will
Published: (2021)

A Borel graphable equivalence relation with no Borel graphing of diameter two
by: Lutz, Patrick
Published: (2026)

Borel Combinatorics of Schreier Graphs of $\mathbb{Z}$-actions
by: Gao, Su, et al.
Published: (2025)

A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)

Borel Homomorphisms from Forests to Kneser Graphs
by: Weilacher, Felix
Published: (2026)

Borel Kernels in Borel Directed Graphs
by: Wang, Ruijun
Published: (2025)

Flipper games for monadically stable graph classes
by: Gajarský, Jakub, et al.
Published: (2023)

Generic sampling and invariant measures on the space of $k$-uniform hypergraphs
by: Ackerman, Nathanael, et al.
Published: (2025)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

Fast algorithms for Vizing's theorem on bounded degree graphs
by: Bernshteyn, Anton, et al.
Published: (2023)

Higher Dimensional Chain Conditions
by: Todorcevic, Stevo, et al.
Published: (2023)