Search

Given an n vertex graph whose edges have colored from one of τ colors C = {ci, C2,..., cr}, we define the Hamilton cycle color profile hcp(G) to be the set of vectors (mi, m2,..., mr) ∈ [0, n}r such that there exists a Hamilton cycle that is the concatenation of τ paths Pi, P2, ∙.., Pr, where Pi contains rΠι edges of color cι. We study hcp(Gn p) when the edges are randomly colored. We discuss the profile close to the threshold for the existence of a Hamilton cycle and the threshold for when ∕icp(Gnjf>) = {(mι, m2,..., mr) ∈ [0,n]r: mi + m2 + ∙ ∙ ∙ + mr = n}. [ABSTRACT FROM AUTHOR]

This paper considers an edge minimization problem in saturated bipartite graphs. An n by n bipartite graph G is H-saturated if G does not contain a subgraph isomorphic to H but adding any missing edge to G creates a copy of H. More than half a century ago, Wessel and Bollob'as independently solved the problem of minimizing the number of edges in K(s,t)-saturated graphs, where K(s,t) is the "ordered"" complete bipartite graph with s vertices from the first color class and t from the second. However, the very natural "unordered"" analogue of this problem was considered only half a decade ago by Moshkovitz and Shapira. When s = t, it can be easily checked that the unordered variant is exactly the same as the ordered case. Later, Gan, Kor'andi, and Sudakov gave an asymptotically tight bound on the minimum number of edges in K(s,t)-saturated n by n bipartite graphs, which is only smaller than the conjecture of Moshkovitz and Shapira by an additive constant. In this paper, we confirm their conjecture for s = t 1 with the classification of the extremal graphs. We also improve the estimates of Gan, Kor'andi, and Sudakov for general s and t, and for all sufficiently large n. [ABSTRACT FROM AUTHOR]