Chorded cycle facets of the clique partitioning polytope

The q -chorded k -cycle inequalities are a class of valid inequalities for the clique partitioning polytope. It is known that for q ∈ { 2 , k − 1 2 } , these inequalities induce facets of the clique partitioning polytope if and only if k is odd. Here, we characterize such facets for arbitrary k and q . More specifically, we prove that the q -chorded k -cycle inequalities induce facets of the clique partitioning polytope if and only if two conditions are satisfied: k = 1 mod q , and if k = 3 q + 1 then q = 3 or q is even. This establishes the existence of many facets induced by q -chorded k -cycle inequalities beyond those previously known.

Authors

Institutions

Publication Details

Journal
Discrete Applied Mathematics
Published
2025-09-25
DOI
https://doi.org/10.1016/j.dam.2025.09.020
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Chorded cycle facets of the clique partitioning polytope

Jannik Irmai, Bjoern Andres, Lucas Fabian Naumann
Discrete Applied Mathematics
Advanced Combinatorial Mathematics
article

Chorded cycle facets of the clique partitioning polytope

Jannik Irmai, Bjoern Andres, Lucas Fabian Naumann
article en

Abstract

The q -chorded k -cycle inequalities are a class of valid inequalities for the clique partitioning polytope. It is known that for q ∈ { 2 , k − 1 2 } , these inequalities induce facets of the clique partitioning polytope if and only if k is odd. Here, we characterize such facets for arbitrary k and q . More specifically, we prove that the q -chorded k -cycle inequalities induce facets of the clique partitioning polytope if and only if two conditions are satisfied: k = 1 mod q , and if k = 3 q + 1 then q = 3 or q is even. This establishes the existence of many facets induced by q -chorded k -cycle inequalities beyond those previously known.

Discrete Applied MathematicsVol. 378
Dresdner Grundwasserforschungszentrum (DE), Technische Universität Dresden (DE)
Openalex Percentile: Top 67%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.