24 citations · 48 across the 15 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 14 cited
A contribution to the second neighborhood problem
Salman Ghazal
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. I…
math.CO2011★ 24 cited
Seymour's second neighborhood conjecture for tournaments missing a generalized star
Salman Ghazal
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. W…
math.CO2011
About The Second Neighborhood Problem in Tournaments Missing Disjoint Stars
Salman Ghazal
We prove Seymour's Second Neighborhood Conjecture when the missing graph is disjoint stars under some conditions. Weaker conditions are required when n=2 or 3. In some cases, we ex…