:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chancelier, Jean-Philippe, de Lara, Michel, Heymann, Benjamin
Format:	Preprint
Published:	2021
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2108.03018
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A formal proof of the Sands-Sauer-Woodrow theorem using the Rocq prover and mathcomp/ssreflect
by: Chancelier, Jean-Philippe
Published: (2026)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
by: Kawamura, Akitoshi, et al.
Published: (2025)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
by: Bodini, Olivier, et al.
Published: (2024)

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
by: De Gaspari, Lorenzo, et al.
Published: (2025)

Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information
by: Alpern, Steve, et al.
Published: (2023)

Two Proofs of the Hamiltonian Cycle Identity
by: Sawczuk, Hamilton, et al.
Published: (2025)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)

Binary constraints on one additional variable can create exponential ascents
by: Cohen, David A., et al.
Published: (2026)

Separation Number and Treewidth, Revisited
by: Houdrouge, Hussein, et al.
Published: (2025)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

A recursive linear time modular decomposition algorithm via LexBFS
by: Corneil, Derek, et al.
Published: (2007)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

Reconsideration of Tangle and Ultrafilter using Separation and Partition
by: Fujita, Takaaki
Published: (2023)

Spectral Moment of Order Four and the Uniqueness of the CCZ class of Dublin APN Permutation
by: Gillot, Valérie, et al.
Published: (2025)

Normality of 8-Bit Bent Function
by: Gillot, Valérie, et al.
Published: (2025)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

Decision problems on geometric tilings
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

A Knowledge Compilation Take on Binary Polynomial Optimization
by: Capelli, Florent, et al.
Published: (2023)

LogicLearner: A Tool for the Guided Practice of Propositional Logic Proofs
by: Inamdar, Amogh, et al.
Published: (2025)

Variants of Wythoff game with terminal positions or blocking maneuvers
by: Renard, Antoine, et al.
Published: (2025)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
by: Shigenobu, Takasugu, et al.
Published: (2025)

Uniform Sampling and Visualization of 3D Reluctant Walks
by: Buckley, Benjamin, et al.
Published: (2024)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
by: Harary, Marc
Published: (2025)

A Proof of Bala's General-$m$ Representation of the Harmonic Numbers
by: Niu, Tong
Published: (2026)

Spectral Sufficient Conditions for Graph Factors
by: Ren, Fengyun, et al.
Published: (2025)

Effective approach of the tridendriform Schroeder tree algebra
by: Catoire, Pierre, et al.
Published: (2026)

Relational Algebras for Subset Selection and Optimisation
by: Pratten, David Robert, et al.
Published: (2025)

Decomposition-Coordination Method for Finite Horizon Bandit Problems
by: de Lara, Michel, et al.
Published: (2021)

The Interplay Between Domination and Separation in Graphs
by: Chakraborty, Dipayan, et al.
Published: (2026)

Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)

A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

An Alternate Proof of Near-Optimal Light Spanners
by: Bodwin, Greg
Published: (2023)

Separation axiom $S_3$ for geodesic convexity in graphs
by: Chepoi, Victor
Published: (2024)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)