Universal targets for homomorphisms of edge-colored graphs

A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two different vertices connected by an edge of the same color. Given a class $\mathcal{F}$ of graphs, a $k$-edge-colored graph $\mathbb{H}$ (not necessarily with the underlying graph in $\mathcal{F}$) is $k$-universal for $\mathcal{F}$ when any $k$-edge-colored graph with the underlying graph in $\mathcal{F}$ admits a homomorphism to $\mathbb{H}$. We characterize graph classes that admit $k$-universal graphs. For such classes, we establish asymptotically almost tight bounds on the size of the smallest universal graph. For a nonempty graph $G$, the density of $G$ is the maximum ratio of the number of edges to the number of vertices ranging over all nonempty subgraphs of $G$. For a nonempty class $\mathcal{F}$ of graphs, $D(\mathcal{F})$ denotes the density of $\mathcal{F}$, that is the supremum of densities of graphs in $\mathcal{F}$. The main results are the following. The class $\mathcal{F}$ admits $k$-universal graphs for $k\geq2$ if and only if there is an absolute constant that bounds the acyclic chromatic number of any graph in $\mathcal{F}$. For any such class, there exists a constant $c$, such that for any $k \geq 2$, the size of the smallest $k$-universal graph is between $k^{D(\mathcal{F})}$ and $ck^{\lceil D(\mathcal{F})\rceil}$. A connection between the acyclic coloring and the existence of universal graphs was first observed by Alon and Marshall (Journal of Algebraic Combinatorics, 8(1):5-13, 1998). One of their results is that for planar graphs, the size of the smallest $k$-universal graph is between $k^3+3$ and $5k^4$. Our results yield that there exists a constant $c$ such that for all $k$, this size is bounded from above by $ck^3$

Connecting the dots (with minimum crossings)

We study a prototype Crossing Minimization problem, defined as follows. Let F be an infinite family of (possibly vertex-labeled) graphs. Then, given a set P of (possibly labeled) n points in the Euclidean plane, a collection L subseteq Lines(P)={l: l is a line segment with both endpoints in P}, and a non-negative integer k, decide if there is a subcollection L'subseteq L such that the graph G=(P,L') is isomorphic to a graph in F and L' has at most k crossings. By G=(P,L'), we refer to the graph on vertex set P, where two vertices are adjacent if and only if there is a line segment that connects them in L'. Intuitively, in Crossing Minimization, we have a set of locations of interest, and we want to build/draw/exhibit connections between them (where L indicates where it is feasible to have these connections) so that we obtain a structure in F. Natural choices for F are the collections of perfect matchings, Hamiltonian paths, and graphs that contain an (s,t)-path (a path whose endpoints are labeled). While the objective of seeking a solution with few crossings is of interest from a theoretical point of view, it is also well motivated by a wide range of practical considerations. For example, links/roads (such as highways) may be cheaper to build and faster to traverse, and signals/moving objects would collide/interrupt each other less often. Further, graphs with fewer crossings are preferred for graphic user interfaces. As a starting point for a systematic study, we consider a special case of Crossing Minimization. Already for this case, we obtain NP-hardness and W[1]-hardness results, and ETH-based lower bounds. Specifically, suppose that the input also contains a collection D of d non-crossing line segments such that each point in P belongs to exactly one line in D, and L does not contain line segments between points on the same line in D. Clearly, Crossing Minimization is the case where d=n - then, P is in general position. The case of d=2 is of interest not only because it is the most restricted non-trivial case, but also since it corresponds to a class of graphs that has been well studied - specifically, it is Crossing Minimization where G=(P,L) is a (bipartite) graph with a so called two-layer drawing. For d=2, we consider three basic choices of F. For perfect matchings, we show (i) NP-hardness with an ETH-based lower bound, (ii) solvability in subexponential parameterized time, and (iii) existence of an O(k^2)-vertex kernel. Second, for Hamiltonian paths, we show (i) solvability in subexponential parameterized time, and (ii) existence of an O(k^2)-vertex kernel. Lastly, for graphs that contain an (s,t)-path, we show (i) NP-hardness and W[1]-hardness, and (ii) membership in XP

On an extremal problem for poset dimension

Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\geqslant n^{1/2}$. We improve the best known upper bound and show $f(n)=\mathcal{O}(n^{2/3})$. For higher dimensions, we show $f_d(n)=\mathcal{O}\left(n^\frac{d}{d+1}\right)$, where $f_d(n)$ is the largest integer such that every poset on $n$ elements has a $d$-dimensional subposet on $f_d(n)$ elements.Comment: removed proof of Theorem 3 duplicating previous work; fixed typos and reference

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while maintaining limited difference of neighbourhoods of the vertices, and it can be seen as widely generalizing several other traditional structural parameters. Having such a sequence at hand allows to solve many otherwise hard problems efficiently. Our paper focuses on a comparison of twin-width to the more traditional tree-width on sparse graphs. Namely, we prove that if a graph $G$ of twin-width at most $2$ contains no $K_{t,t}$ subgraph for some integer $t$, then the tree-width of $G$ is bounded by a polynomial function of $t$. As a consequence, for any sparse graph class $\mathcal{C}$ we obtain a polynomial time algorithm which for any input graph $G \in \mathcal{C}$ either outputs a contraction sequence of width at most $c$ (where $c$ depends only on $\mathcal{C}$), or correctly outputs that $G$ has twin-width more than $2$. On the other hand, we present an easy example of a graph class of twin-width $3$ with unbounded tree-width, showing that our result cannot be extended to higher values of twin-width

Kolorowe homomorfizmy

Graf k-kolorowy to skończony, prosty graf, którego krawędziom przyporządkowano liczby od 1 do k. Funkcję ze zbioru wierzchołków jednego k-kolorowego grafu w drugi nazywamy homomorfizmem, jeżeli każda krawędź pierwszego grafu jest odwzorowana w krawędź drugiego grafu z zachowaniem kolorów krawędzi. Dla klasy grafów F, k-kolorowy graf H (niekoniecznie z F) nazywamy k-uniwersalnym dla F, jeżeli każdy k-kolorowy graf z F można odwzorować homomorficznie w H. W niniejszej pracy podajemy pełną charakteryzację klas grafów posiadających grafy k-uniwersalne. Dla każdej takiej klasy grafów określamy również prawie dokładne asymptotyczne ograniczenia na wielkość grafu k-uniwersalnego.Główne wyniki pracy są następujące. Dla każdego k > 1, klasa grafów F posiada graf k-uniwersalny wtedy i tylko wtedy, gdy acykliczna liczba chromatyczna grafów z F jest ograniczona przez stałą. Każda taka klasa posiada graf k-uniwersalny, którego rozmiar jako funkcja zmiennej k mieści się asymptotycznie pomiędzy k^d a k^D, gdzie d jest równe maksymalnemu stosunkowi liczby krawędzi do liczby wierzchołków w pewnym podgrafie pewnego grafu z klasy F, zaś D jest najmniejszą liczbą naturalną nie mniejszą od d.Związek między acykliczną liczbą chromatyczną a istnieniem grafów uniwersalnych został zauważony po raz pierwszy przez Alona i Marshalla (Journal of Algebraic Combinatorics, 8(1):5-13, 1998). Udowodnili oni między innymi, że rozmiar najmniejszego grafu k-uniwersalnego dla klasy grafów planarnych lokuje się między k^3 + 3 a 5k^4. Nasze wyniki stwierdzają między innymi, że rozmiar ten jest asymptotycznie równy k^3.A k-edge-colored graph is a finite, simple graph with edges labeled by numbers 1, ..., k. A function from the vertex set of one k-edge-colored graph to another is a homomorphism if the color of every edge is preserved over the mapping. Given a class of graphs F, a k-edge-colored graph H (not necessarily from F) is k-universal for F when any k-edge-colored graph with the underlying graph in F maps homomorphically to H. We characterize graph classes that admit k-universal graphs. For such classes, we establish asymptotically almost tight bounds on the size of the smallest universal graph.The main results are the following. A class of graphs F admits k-universal graphs for k > 1 if and only if there is an absolute constant that bounds the acyclic chromatic number of any graph in F. For any such class, the size of the smallest k-universal graph is asymptotically between k^d and k^D, where d is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of all graphs in F, and D is the smallest integer not less than d.A connection between the acyclic coloring and the existence of universal graphs was first observed by Alon and Marshall (Journal of Algebraic Combinatorics, 8(1):5-13, 1998). One of their results is that for the class of planar graphs, the size of the smallest k-universal graph is between k^3 + 3 and 5k^4. Our results yield that this size is asymptotically equal to k^3