3 papers
math.CO2026
When all directed cycles have the same weight
Eli Berger, Daniel Carter, Paul Seymour
A digraph is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that…
math.CO2025
Pathographs and some (un)decidability results
Daniel Carter, Nicolas Trotignon
We introduce pathographs as a framework to study graph classes defined by forbidden structures, including forbidding induced subgraphs, minors, etc. Pathographs approximately gener…
math.CO2024
On the joint embedding property for cographs and trees
Daniel Carter
A family of graphs is said to have the joint embedding property (JEP) if for every , there is an that contains both …