On the Geometric Ramsey Number of Outerplanar Graphs

We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by $O(n^{3})$ and $O(n^{10})$, in the convex and general case, respectively. We then apply similar methods to prove an $n^{O(\log(n))}$ upper bound on the Ramsey number of a path with $n$ ordered vertices.Comment: 15 pages, 7 figure

Ramsey numbers of ordered graphs

An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N$ vertices and with edges colored by two colors contains a monochromatic copy of $\mathcal{G}$. In contrast with the case of unordered graphs, we show that there are arbitrarily large ordered matchings $\mathcal{M}_n$ on $n$ vertices for which $\overline{R}(\mathcal{M}_n)$ is superpolynomial in $n$. This implies that ordered Ramsey numbers of the same graph can grow superpolynomially in the size of the graph in one ordering and remain linear in another ordering. We also prove that the ordered Ramsey number $\overline{R}(\mathcal{G})$ is polynomial in the number of vertices of $\mathcal{G}$ if the bandwidth of $\mathcal{G}$ is constant or if $\mathcal{G}$ is an ordered graph of constant degeneracy and constant interval chromatic number. The first result gives a positive answer to a question of Conlon, Fox, Lee, and Sudakov. For a few special classes of ordered paths, stars or matchings, we give asymptotically tight bounds on their ordered Ramsey numbers. For so-called monotone cycles we compute their ordered Ramsey numbers exactly. This result implies exact formulas for geometric Ramsey numbers of cycles introduced by K\'arolyi, Pach, T\'oth, and Valtr.Comment: 29 pages, 13 figures, to appear in Electronic Journal of Combinatoric

Unit Grid Intersection Graphs: Recognition and Properties

It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs (UGIGs), the recognition remains hard, as well as for all graph classes contained inbetween. The result holds even when considering only graphs with arbitrarily large girth. Furthermore, we ask the question of representing UGIGs on grids of minimal size. We show that the UGIGs that can be represented in a square of side length 1+epsilon, for a positive epsilon no greater than 1, are exactly the orthogonal ray graphs, and that there exist families of trees that need an arbitrarily large grid

Network and Seiberg Duality

We define and study a new class of 4d N=1 superconformal quiver gauge theories associated with a planar bipartite network. While UV description is not unique due to Seiberg duality, we can classify the IR fixed points of the theory by a permutation, or equivalently a cell of the totally non-negative Grassmannian. The story is similar to a bipartite network on the torus classified by a Newton polygon. We then generalize the network to a general bordered Riemann surface and define IR SCFT from the geometric data of a Riemann surface. We also comment on IR R-charges and superconformal indices of our theories.Comment: 28 pages, 28 figures; v2: minor correction

The history of degenerate (bipartite) extremal graph problems

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version of our survey presented in Erdos 100. In this version 2 only a citation was complete

Scattering Amplitudes and Toric Geometry

In this paper we provide a first attempt towards a toric geometric interpretation of scattering amplitudes. In recent investigations it has indeed been proposed that the all-loop integrand of planar N=4 SYM can be represented in terms of well defined finite objects called on-shell diagrams drawn on disks. Furthermore it has been shown that the physical information of on-shell diagrams is encoded in the geometry of auxiliary algebraic varieties called the totally non negative Grassmannians. In this new formulation the infinite dimensional symmetry of the theory is manifest and many results, that are quite tricky to obtain in terms of the standard Lagrangian formulation of the theory, are instead manifest. In this paper, elaborating on previous results, we provide another picture of the scattering amplitudes in terms of toric geometry. In particular we describe in detail the toric varieties associated to an on-shell diagram, how the singularities of the amplitudes are encoded in some subspaces of the toric variety, and how this picture maps onto the Grassmannian description. Eventually we discuss the action of cluster transformations on the toric varieties. The hope is to provide an alternative description of the scattering amplitudes that could contribute in the developing of this very interesting field of research.Comment: 58 pages, 25 figures, typos corrected, a reference added, to be published in JHE