AbstractDetermining the chromatic number of a graph is a difficult but important problem. Hence, it is not surprising that a variety of questions in Graph Theory concern the search for meaningful upper bounds for the chromatic number of certain families of graphs. One type of graph family that received considerable attention is that of H-free graphs, that is, the family of graphs G which do not...
Abstract:Lagrangian fillings are key objects in symplectic geometry. Wrapped Floer theory can be used to show some rigidity property of embedded Lagrangian fillings. We extend the wrapped Floer theory to immersed Lagrangian fillings and obtain lower bounds of double points of immersed Lagrangian disk fillings