Constructing graphs with no independent transversals

HIGHLIGHTS

• What: 2.1 Disjoint unions of the complete bipartite graph Kd,d First the authors show how to prove Theorem 2.
• Who: Penny Haxell et al. from the (UNIVERSITY) have published the research work: Constructing graphs with no independent transversals, in the Journal: (JOURNAL)
• How: The authors describe a simple iterative method that can be used to derive essentially all of the constructions cited above.
• Future: It is the result they used to solve one direction of an extremal problem of Bollobás Erdős and Szemerédi mentioned in the . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.