467 research outputs found
Saturation numbers in tripartite graphs
Given graphs and , a subgraph is an -saturated
subgraph of if , but for all . The saturation number of in , denoted
, is the minimum number of edges in an -saturated subgraph
of . In this paper we study saturation numbers of tripartite graphs in
tripartite graphs. For and , , and sufficiently
large, we determine and
exactly and
within an additive constant.
We also include general constructions of -saturated subgraphs of
with few edges for .Comment: 18 pages, 6 figure
Planar digraphs without large acyclic sets
Given a directed graph, an acyclic set is a set of vertices inducing a
subgraph with no directed cycle. In this note we show that there exist oriented
planar graphs of order for which the size of the maximum acyclic set is at
most , for any . This disproves a conjecture of
Harutyunyan and shows that a question of Albertson is best possible.Comment: 3 pages, 1 figur
Three Existence Problems in Extremal Graph Theory
Proving the existence or nonexistence of structures with specified properties is the impetus for many classical results in discrete mathematics.
In this thesis we take this approach to three different structural questions rooted in extremal graph theory.
When studying graph representations, we seek efficient ways to encode the structure of a graph.
For example, an {\it interval representation} of a graph is an assignment of intervals on the real line to the vertices of such that two vertices are adjacent if and only if their intervals intersect.
We consider graphs that have {\it bar -visibility representations}, a generalization of both interval representations and another well-studied class of representations known as visibility representations.
We obtain results on , the family of graphs having bar -visibility representations.
We also study .
In particular, we determine the largest complete graph having a bar -visibility representation, and we show that there are graphs that do not have bar -visibility representations for any .
Graphs arise naturally as models of networks, and there has been much study of the movement of information or resources in graphs.
Lampert and Slater \cite{LS} introduced {\it acquisition} in weighted graphs, whereby weight moves around provided that each move transfers weight from a vertex to a heavier neighbor.
Our goal in making acquisition moves is to consolidate all of the weight in on the minimum number of vertices; this minimum number is the {\it acquisition number} of .
We study three variations of acquisition in graphs: when a move must transfer all the weight from a vertex to its neighbor, when each move transfers a single unit of weight, and when a move can transfer any positive amount of weight.
We consider acquisition numbers in various families of graphs, including paths, cycles, trees, and graphs with diameter .
We also study, under the various acquisition models, those graphs in which all the weight can be moved to a single vertex.
Restrictive local conditions often have far-reaching impacts on the global structure of mathematical objects.
Some local conditions are so limiting that very few objects satisfy the requirements.
For example, suppose that we seek a graph in which every two vertices have exactly one common neighbor.
Such graphs are called {\it friendship graphs}, and Wilf~\cite{Wilf} proved that the only such graphs consist of edge-disjoint triangles sharing a common vertex.
We study a related structural restriction where similar phenomena occur.
For a fixed graph , we consider those graphs that do not contain and such that the addition of any edge completes exactly one copy of .
Such a graph is called {\it uniquely -saturated}.
We study the existence of uniquely -saturated graphs when is a path or a cycle.
In particular, we determine all of the uniquely -saturated graphs; there are exactly ten.
Interestingly, the uniquely -saturated graphs are precisely the friendship graphs characterized by Wilf
Graph Saturation in Multipartite Graphs
Let be a fixed graph and let be a family of graphs. A
subgraph of is -saturated if no member of
is a subgraph of , but for any edge in , some element of
is a subgraph of . We let and
denote the maximum and minimum size of an
-saturated subgraph of , respectively. If no element of
is a subgraph of , then .
In this paper, for and we determine
, where is the complete balanced -partite
graph with partite sets of size . We also give several families of
constructions of -saturated subgraphs of for . Our results
and constructions provide an informative contrast to recent results on the
edge-density version of from [A. Bondy, J. Shen, S.
Thomass\'e, and C. Thomassen, Density conditions for triangles in multipartite
graphs, Combinatorica 26 (2006), 121--131] and [F. Pfender, Complete subgraphs
in multipartite graphs, Combinatorica 32 (2012), no. 4, 483--495].Comment: 16 pages, 4 figure
List Distinguishing Parameters of Trees
A coloring of the vertices of a graph G is said to be distinguishing}
provided no nontrivial automorphism of G preserves all of the vertex colors.
The distinguishing number of G, D(G), is the minimum number of colors in a
distinguishing coloring of G. The distinguishing chromatic number of G,
chi_D(G), is the minimum number of colors in a distinguishing coloring of G
that is also a proper coloring.
Recently the notion of a distinguishing coloring was extended to that of a
list distinguishing coloring. Given an assignment L= {L(v) : v in V(G)} of
lists of available colors to the vertices of G, we say that G is (properly)
L-distinguishable if there is a (proper) distinguishing coloring f of G such
that f(v) is in L(v) for all v. The list distinguishing number of G, D_l(G), is
the minimum integer k such that G is L-distinguishable for any list assignment
L with |L(v)| = k for all v. Similarly, the list distinguishing chromatic
number of G, denoted chi_{D_l}(G) is the minimum integer k such that G is
properly L-distinguishable for any list assignment L with |L(v)| = k for all v.
In this paper, we study these distinguishing parameters for trees, and in
particular extend an enumerative technique of Cheng to show that for any tree
T, D_l(T) = D(T), chi_D(T)=chi_{D_l}(T), and chi_D(T) <= D(T) + 1.Comment: 10 page
- …