»ã±¨±êÌâ (Title)£ºTournament with large domination number£¨´ó½ÚÔìÊýµÄ½ÏÁ¿Í¼£©

»ã±¨ÈË (Speaker)£ºÎâºÓ»Ô ¸±½ÌÊÚ£¨¸´µ©´óѧ ÉϺ£ÊýѧÖÐÐÄ£©

»ã±¨¹¦·ò (Time)£º2023Äê9ÔÂ15ÈÕ (ÖÜÎå) 10:30

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿E408

Ô¼ÇëÈË(Inviter)£ºÐ»ÆëÇß

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºA famous conjecture of Erdos and Hajnal is equivenent to say that if a tournament has no acyclic set with size n?, then it contains all tournament H with small size as a subtournament . We study the analogous problem on tournaments with large domination number. A tournament H is called rebel if there exists a constant t(H), such that any tournament with domination number at least t(H) contains H as a subtournament. We will show a family of tournaments are rebels. It is joint work with Simiao Liu.