Benjamin R. Moore

activity

20242026

collaborators

4 papers

math.CO2026

Homomorphism counting for immersion-closed classes is not isomorphism

Andrea Jiménez, Benjamin Moore, Daniel A. Quiroz +1

Lovász proved that two graphs $G$ and $H$ are isomorphic if $hom (K, G) = hom (K, H)$ for all graphs $K$ , where $hom (G_{1}, G_{2})$ denotes the number of homomorphisms from $G_{1}$ to $G_2…

math.CO2026

Characterizing Large Clique Number in Tournaments

Logan Crew, Xinyue Fan, Hidde Koerts +2

Aboulker, Aubian, Charbit, and Lopes (2023) defined the clique number of a tournament to be the minimum clique number of one of its backedge graphs. Here we show that if $T$ is a t…

math.CO2025

Flow-critical graphs

Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický +3

Lovász et al. proved that every $6$ -edge-connected graph has a nowhere-zero $3$ -flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3…

math.CO2024

Smoothed analysis for graph isomorphism

Michael Anastos, Matthew Kwan, Benjamin Moore

There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosop…