Cover Image

Trees in graphs of large linear cliquewidth

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bojańczyk, Mikołaj, Ohlmann, Pierre
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rank-decreasing transductions
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

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

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Low rank MSO
by: Bojańczyk, Mikołaj, et al.
Published: (2025)

Positionality in $Σ_0^2$ and a completeness result
by: Ohlmann, Pierre, et al.
Published: (2023)

Hardness of monadic second-order formulae over succinct graphs
by: Gamard, Guilhem, et al.
Published: (2023)

Characterising memory in infinite games
by: Casares, Antonio, et al.
Published: (2022)

A positional $\mathbfΠ^0_3$-complete objective
by: Casares, Antonio, et al.
Published: (2024)

Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)

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

Positional $ω$-regular languages
by: Casares, Antonio, et al.
Published: (2024)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
by: Casares, Antonio, et al.
Published: (2025)

A linear proof language for second-order intuitionistic linear logic
by: Díaz-Caro, Alejandro, et al.
Published: (2023)

A concrete model for a typed linear algebraic lambda calculus
by: Díaz-Caro, Alejandro, et al.
Published: (2018)

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)

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

Making first order linear logic a generating grammar
by: Slavnov, Sergey
Published: (2022)

A linear linear lambda-calculus
by: Díaz-Caro, Alejandro, et al.
Published: (2022)

Tree algebras and bisimulation-invariant MSO on finite graphs
by: Colcombet, Thomas, et al.
Published: (2024)

List types for resource aware languages: an implicit name approach
by: Ghilezan, Silvia, et al.
Published: (2021)

Reflexive graph lenses in univalent foundations
by: Sterling, Jonathan
Published: (2024)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Unfoldings and coverings of weighted graphs
by: Courcelle, Bruno
Published: (2022)

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

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)

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

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

Extension preservation on dense graph classes
by: Eleftheriadis, Ioannis
Published: (2024)

The Size-Change Principle for Mixed Inductive and Coinductive types
by: Hyvernat, Pierre
Published: (2024)

The Qualitative Collapse of Concurrent Games
by: Clairambault, Pierre
Published: (2024)

A Relational Theory of Grounding and a new Grounder for SMT
by: Carbonnelle, Pierre
Published: (2026)

Adhesive category theory for graph rewriting in Rocq
by: Arsac, Samuel, et al.
Published: (2025)

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

A finite presentation of graphs of treewidth at most three
by: Doumane, Amina, et al.
Published: (2024)

A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
by: Bauer, Esaïe, et al.
Published: (2025)

Order-invariant cluster first-order logic on graph classes of bounded degree
by: Ghasemi, Fatemeh, et al.
Published: (2026)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
by: Brunar, Johanna, et al.
Published: (2025)

Maths with Coq in L1, a pedagogical experiment
by: Kerjean, Marie, et al.
Published: (2025)

From Thin Concurrent Games to Generalized Species of Structures (Extended Version)
by: Clairambault, Pierre, et al.
Published: (2023)