Pith. sign in

REVIEW 1 cited by

Boolean combinations of graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.19551 v1 pith:HAO6J7ZK submitted 2024-12-27 math.CO cs.DM

Sarosh Adenwalla , Samuel Braunfeld , John Sylvester , Viktor Zamaraev This is my paper
classification math.COcs.DM
keywords booleancombinationsgraphscombinatorialobjectsaffectallowapplied
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular $\chi$-boundedness, as well as characterize the structure of boolean combinations of graphs from various classes.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Set-defined graph classes: $\chi$-boundedness meets tropical algebra

    cs.DM 2026-07 accept novelty 8.0 of 10

    Full set-defined classes are polynomially χ-bounded iff they avoid high-chromatic shift graphs, decidable via tropical feasibility dual to mean-payoff games.

Pith tools