Smaller universal targets for homomorphisms of edge-colored graphs

Grzegorz Guśpiel ()
Additional contact information
Grzegorz Guśpiel: Jagiellonian University

Journal of Combinatorial Optimization, 2022, vol. 43, issue 5, No 29, 1534-1544

Abstract: Abstract For a graph G, the density of G, denoted D(G), is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of G. For a class $$\mathcal {F}$$ F of graphs, the value $$D(\mathcal {F})$$ D ( F ) is the supremum of densities of graphs in $$\mathcal {F}$$ F . A k-edge-colored graph is a finite, simple graph with edges labeled by numbers $$1,\ldots ,k$$ 1 , … , 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}$$ F of graphs, a k-edge-colored graph $$\mathbb {H}$$ H (not necessarily with the underlying graph in $$\mathcal {F}$$ F ) is k-universal for $$\mathcal {F}$$ F when any k-edge-colored graph with the underlying graph in $$\mathcal {F}$$ F admits a homomorphism to $$\mathbb {H}$$ H . Such graphs are known to exist exactly for classes $$\mathcal {F}$$ F of graphs with acyclic chromatic number bounded by a constant. The minimum number of vertices in a k-uniform graph for a class $$\mathcal {F}$$ F is known to be $$\Omega (k^{D(\mathcal {F})})$$ Ω ( k D ( F ) ) and $$O(k^{{\left\lceil D(\mathcal {F}) \right\rceil }})$$ O ( k D ( F ) ) . In this paper we close the gap by improving the upper bound to $$O(k^{D(\mathcal {F})})$$ O ( k D ( F ) ) for any rational $$D(\mathcal {F})$$ D ( F ) .

Keywords: Universal graph; Homomorphism bound; Edge coloring; Graph density; Maximum average degree (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00680-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-020-00680-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00680-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().