Testing H-freeness on sparse graphs, the case of bounded expansion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Humeau, Samuel, Kanté, Mamadou Moustapha, Mock, Daniel, Picavet, Timothé, Vigny, Alexandre
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2511.10230