5 papers · 1 filter
The Second Neighborhood Conjecture for Oriented Graphs Missing chair and co-chair-Free Graph
Darine Al Mniny, Salman Ghazal
Seymour's Second Neighborhood Conjecture (SNC) asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. In th…
Remarks on the subdivisions of bispindles and two-blocks cycles in highly chromatic digraphs
Darine Al Mniny, Salman Ghazal
A -bispindle is the union of two -dipaths of respective lengths and , and one -dipath of length , all these dipaths being pairwise i…
About the Erdös-Hajnal conjecture for seven-vertex tournaments
Soukaina Zayat, Salman Ghazal
A celebrated unresolved conjecture of Erdös and Hajnal states that for every undirected graph there exists such that every undirected graph on vertices that…
Tournaments and the Erdös-Hajnal Conjecture
Soukaina Zayat, Salman Ghazal
The celebrated Erdös-Hajnal conjecture states that for every undirected graph there exists such that every undirected graph on vertices that does not contain…
Erdös-Hajnal Conjecture for New Infinite Families of Tournaments
Soukaina Zayat, Salman Ghazal
Erdös-Hajnal conjecture states that for every undirected graph there exists such that every undirected graph on vertices that does not contain as an indu…