8 research outputs found
Coloring and covering problems on graphs
The \emph{separation dimension} of a graph , written , is the minimum number of linear orderings of such that every two nonincident edges are ``separated'' in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the \emph{fractional separation dimension} , which is the minimum of such that some linear orderings (repetition allowed) separate every two nonincident edges at least times.
In contrast to separation dimension, we show fractional separation dimension is bounded: always , with equality if and only if contains . There is no stronger bound even for bipartite graphs, since . We also compute for cycles and some complete tripartite graphs. We show that when is a tree and present a sequence of trees on which the value tends to . We conjecture that when the -free -vertex graph maximizing is .
We also consider analogous problems for circular orderings, where pairs of nonincident edges are separated unless their endpoints alternate. Let be the number of circular orderings needed to separate all pairs, and let be the fractional version. Among our results: (1) if and only is outerplanar. (2) when is bipartite. (3) . (4) , with equality if and only if . (5) .
A \emph{star -coloring} is a proper -coloring where the union of any two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition the vertex set into a 2-independent set and a forest; such a partition is called an \emph{\Ifp}. We use discharging to prove that every graph with maximum average degree less than has an \Ifp, which is sharp and improves the result of Bu, Cranston, Montassier, Raspaud, and Wang (2009). As a corollary, we gain that every planar graph with girth at least 10 has a star 4-coloring.
A proper vertex coloring of a graph is \emph{-dynamic} if for each , at least colors appear in . We investigate -dynamic versions of coloring and list coloring. We prove that planar and toroidal graphs are 3-dynamically 10-choosable, and this bound is sharp for toroidal graphs.
Given a proper total -coloring of a graph , we define the \emph{sum value} of a vertex to be . The smallest integer such that has a proper total -coloring whose sum values form a proper coloring is the \emph{neighbor sum distinguishing total chromatic number} . Pil{\'s}niak and Wo{\'z}niak~(2013) conjectured that for any simple graph with maximum degree . We prove this bound to be asymptotically correct by showing that . The main idea of our argument relies on Przyby{\l}o's proof (2014) for neighbor sum distinguishing edge-coloring
Extremal problems involving forbidden subgraphs
In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs.
In Chapter 2, we consider improper coloring of graphs without short cycles. We find how sparse an improperly critical graph can be when it has no short cycle. In particular, we find the exact threshold of density of triangle-free -colorable graphs and we find the asymptotic threshold of density of -colorable graphs of large girth when .
In Chapter 3, we consider other variations of graph coloring. We determine harmonious chromatic number of trees with large maximum degree and show upper bounds of -dynamic chromatic number of graphs in terms of other parameters.
In Chapter 4, we consider how dense a hypergraph can be when we forbid some subgraphs.
In particular, we characterize hypergraphs with the maximum number of edges that contain no -regular subgraphs. We also establish upper bounds for the number of edges in graphs and hypergraphs with no edge-disjoint equicovering subgraphs
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..