Image de couverture de livre

Conditional Separation as a Binary Relation. A Coq Assisted Proof

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chancelier, Jean-Philippe, de Lara, Michel, Heymann, Benjamin
Format:	Preprint
Publié:	2021
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
par: Kawamura, Akitoshi, et autres
Publié: (2025)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
par: De Gaspari, Lorenzo, et autres
Publié: (2025)

On Separating Path and Tree Systems in Graphs
par: Biniaz, Ahmad, et autres
Publié: (2023)

Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information
par: Alpern, Steve, et autres
Publié: (2023)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
par: Bodini, Olivier, et autres
Publié: (2024)

Two Proofs of the Hamiltonian Cycle Identity
par: Sawczuk, Hamilton, et autres
Publié: (2025)

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

Binary constraints on one additional variable can create exponential ascents
par: Cohen, David A., et autres
Publié: (2026)

Separation Number and Treewidth, Revisited
par: Houdrouge, Hussein, et autres
Publié: (2025)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
par: Chen, Xinyue, et autres
Publié: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
par: Botler, Fábio, et autres
Publié: (2024)

A recursive linear time modular decomposition algorithm via LexBFS
par: Corneil, Derek, et autres
Publié: (2007)

Spectral Moment of Order Four and the Uniqueness of the CCZ class of Dublin APN Permutation
par: Gillot, Valérie, et autres
Publié: (2025)

Normality of 8-Bit Bent Function
par: Gillot, Valérie, et autres
Publié: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
par: Fang, Xuan, et autres
Publié: (2025)

Boundedness and Separation in the Graph Covering Number Framework
par: Goetze, Miriam, et autres
Publié: (2025)

Reconsideration of Tangle and Ultrafilter using Separation and Partition
par: Fujita, Takaaki
Publié: (2023)

Upper Bounds on the Average Height of Random Binary Trees
par: Benkner, Louisa Seelbach
Publié: (2024)

Decision problems on geometric tilings
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
par: Gregor, Petr, et autres
Publié: (2023)

Uniform Sampling and Visualization of 3D Reluctant Walks
par: Buckley, Benjamin, et autres
Publié: (2024)

A Knowledge Compilation Take on Binary Polynomial Optimization
par: Capelli, Florent, et autres
Publié: (2023)

Effective approach of the tridendriform Schroeder tree algebra
par: Catoire, Pierre, et autres
Publié: (2026)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
par: Shigenobu, Takasugu, et autres
Publié: (2025)

Variants of Wythoff game with terminal positions or blocking maneuvers
par: Renard, Antoine, et autres
Publié: (2025)

Spectral Sufficient Conditions for Graph Factors
par: Ren, Fengyun, et autres
Publié: (2025)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
par: Harary, Marc
Publié: (2025)

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

Relational Algebras for Subset Selection and Optimisation
par: Pratten, David Robert, et autres
Publié: (2025)

Cops & Robber on Periodic Temporal Graphs
par: De Carufel, Jean-Lou, et autres
Publié: (2024)

LogicLearner: A Tool for the Guided Practice of Propositional Logic Proofs
par: Inamdar, Amogh, et autres
Publié: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
par: Bastide, Paul, et autres
Publié: (2025)

A lattice on Dyck paths close to the Tamari lattice
par: Baril, Jean-Luc, et autres
Publié: (2023)

A quasi-optimal upper bound for induced paths in sparse graphs
par: Couëtoux, Basile, et autres
Publié: (2025)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
par: Das, Sandip, et autres
Publié: (2023)

Progress on Self Identifying Codes
par: Jean, Devin, et autres
Publié: (2025)

A Boolean encoding of the Most Permissive semantics for Boolean networks
par: de Chancel, Laure, et autres
Publié: (2026)

A Weight Function Lemma Heuristic for Graph Pebbling
par: Bridi, G. A., et autres
Publié: (2025)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)