:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hliněný, Petr, Jedelský, Jan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Combinatorics
Online Access:	https://arxiv.org/abs/2501.18326
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

On first-order model checking parameterized by the number of variables
by: Jedelský, Jan
Published: (2026)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Measuring Depth of Matroids
by: Balabán, Jakub, et al.
Published: (2026)

On Planarity of Graphs in Homotopy Type Theory
by: Prieto-Cubides, Jonathan, et al.
Published: (2021)

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

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

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

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

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Dreier, Jan
Published: (2021)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

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

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

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

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

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

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

An Introduction to Razborov's Flag Algebra as a Proof System for Extremal Graph Theory
by: Jeong, Gyeongwon, et al.
Published: (2026)

The Finite Length Property of the Rado Graph and Friends
by: Yang, Jingjie, et al.
Published: (2026)

Tutte's theorem as an educational formalization project
by: Otte, Pim
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Further Comments on Yablo's Construction
by: Schlechta, Karl
Published: (2025)

Additive systems for $\mathbb{Z}$ are undecidable
by: Zabolotskii, Andrei
Published: (2025)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2025)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition
by: Fang, Wenjie
Published: (2022)

A Formal Proof of R(4,5)=25
by: Gauthier, Thibault, et al.
Published: (2024)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

A Classification of Long-Refinement Graphs for Colour Refinement
by: Kiefer, Sandra, et al.
Published: (2025)

Twin-width of Planar Graphs; a Short Proof
by: Hliněný, Petr
Published: (2023)

The unstable formula theorem revisited via algorithms
by: Malliaris, Maryanthe, et al.
Published: (2022)

Agnostic Online Learning and Excellent Sets
by: Malliaris, Maryanthe, et al.
Published: (2021)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)