Towards Erdos-Hajnal property for dp-minimal graphs
Abstract
We introduce the notion of strongly k2-free graphs, which contain dp-minimal graphs. We show that under some sparsity assumption, given a rainbow k2-free blockade we can find a rainbow k-12-free blockade. This might serve as an intermediate step towards Erd os-Hajnal property for dp-minimal graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.