93 research outputs found
Note on terminal-pairability in complete grid graphs
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gyárfás, and Lehel (1999). © 2017 Elsevier B.V
Minimal Path Pairable Graphs
https://digitalcommons.memphis.edu/speccoll-faudreerj/1216/thumbnail.jp
Generating EPR-pairs from an -party resource state
Motivated by quantum network applications over classical channels, we
initiate the study of -party resource states from which LOCC protocols can
create EPR-pairs between any disjoint pairs of parties. We give
constructions of such states where is not too far from the optimal
while the individual parties need to hold only a constant number of qubits. In
the special case when each party holds only one qubit, we describe a family of
-qubit states with proportional to based on Reed-Muller codes,
as well as small numerically found examples for and . We also prove
some lower bounds, for example showing that if then the parties must
have at least qubits each.Comment: 34 pages, 5 figures. Added 2 new references in Sec 1.4 and Sec
Problems in Extremal Graph Theory
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.Chapter 1 is dedicated to the results in the papers with Antnio Giro, Gbor Mszros, and Richard Snyder. We say that a graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in eachpair. We study the extremal behavior of maximum degree and diameter in some classes of path-pairable graphs. In particular we show that a path-pairable planar graph must have a vertex of linear degree.In Chapter 2 we present a joint work with Antnio Giro and Teeradej Kittipassorn. Given graphs G and H, we say that a graph F is H-saturated in G if F is H-free subgraph of G, but addition of any edge from E(G) to F creates a copy of H. Here we deal with the case when G is a complete k-partite graph with n vertices in each class, and H is a complete graph on r vertices. We prove bounds, which are tight for infinitely many values of k and r, on the minimal number of edges in a H-saturated graph in G, for this choice of G and H, answering questions of Ferrara, Jacobson, Pfender, and Wenger; and generalizing a result of Roberts.Chapter 3 is about a joint paper with Antnio Giro and Teeradej Kittipassorn. A coloring of the vertices of a digraph D is called majority coloring if no vertex of D receives the same color as more than half of its outneighbours. This was introduced by van der Zypen in 2016. Recently, Kreutzer, Oum, Seymour, van der Zypen, and Wood posed a number of problems related to this notion: here we solve several of them.In Chapter 4 we present a joint work with Antnio Giro. We show that given any integer k there exist functions g1(k), g2(k) such that the following holds. For any graph G with maximum degree one can remove fewer than g1(k) ^{1/2} vertices from G so that the remaining graph H has k vertices of the same degree at least (H) g2(k). It is an approximate version of conjecture of Caro and Yuster; and Caro, Lauri, and Zarb, who conjectured that g2(k) = 0.Chapter 5 concerns results obtained together with Kazuhiro Nomoto, Julian Sahasrabudhe, and Richard Snyder. We study a graph parameter, the graph burning number, which is supposed to measure the speed of the spread of contagion in a graph. We prove tight bounds on the graph burning number of some classes of graphs and make a progress towards a conjecture of Bonato, Janssen, and Roshanbin about the upper bound of graph burning number of connected graphs.In Chapter 6 we present a joint work with Teeradej Kittipassorn. We study the set of possible numbers of triangles a graph on a given number of vertices can have. Among other results, we determine the asymptotic behavior of the smallest positive integer m such that there is no graph on n vertices with exactly m copies of a triangle. We also prove similar results when we replace triangle by any fixed connected graph
Viral RNAs are unusually compact.
A majority of viruses are composed of long single-stranded genomic RNA molecules encapsulated by protein shells with diameters of just a few tens of nanometers. We examine the extent to which these viral RNAs have evolved to be physically compact molecules to facilitate encapsulation. Measurements of equal-length viral, non-viral, coding and non-coding RNAs show viral RNAs to have among the smallest sizes in solution, i.e., the highest gel-electrophoretic mobilities and the smallest hydrodynamic radii. Using graph-theoretical analyses we demonstrate that their sizes correlate with the compactness of branching patterns in predicted secondary structure ensembles. The density of branching is determined by the number and relative positions of 3-helix junctions, and is highly sensitive to the presence of rare higher-order junctions with 4 or more helices. Compact branching arises from a preponderance of base pairing between nucleotides close to each other in the primary sequence. The density of branching represents a degree of freedom optimized by viral RNA genomes in response to the evolutionary pressure to be packaged reliably. Several families of viruses are analyzed to delineate the effects of capsid geometry, size and charge stabilization on the selective pressure for RNA compactness. Compact branching has important implications for RNA folding and viral assembly
ON PATH-PAIRABILITY IN THE CARTESIAN PRODUCT OF GRAPHS
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of pathpairability, depending on the number of vertices in the Cartesian product. We present path-pairable graph families that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented
- …