The Erdős-Hajnal Property for the six-vertex Graph with Edge Set \ab,bc,cd,de,af,bf,df\
Viet-Hoang Tran, Tan M. Nguyen
math.COarXiv:2608.28551
Abstract
We prove that the six-vertex graph with edge set \ab,bc,cd,de,af,bf,df\ has the Erdős-Hajnal property. The proof adapts the iterative-sparsification method of Nguyen, Scott, and Seymour within the comb-based framework of Huang, Ju, and Zhou.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato