scholarly journals On the ranks of configurations on the complete graph

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Robert Cori ◽  
Yvan Le Borgne
Keyword(s):  
Complete Graph ◽  
Efficient Algorithm ◽  
Complete Graphs ◽  
International Audience ◽  
Definition Of ◽  
Dyck Words

International audience We consider the parameter rank introduced for graph configurations by M. Baker and S. Norine. We focus on complete graphs and obtain an efficient algorithm to determine the rank for these graphs. The analysis of this algorithm leads to the definition of a parameter on Dyck words, which we call prerank. We prove that the distribution of area and prerank on Dyck words of given length $2n$ leads to a polynomial with variables $q,t$ which is symmetric in these variables. This polynomial is different from the $q,t-$Catalan polynomial studied by A. Garsia, J. Haglund and M. Haiman.

scholarly journals $Star^1$-convex functions on tropical linear spaces of complete graphs

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Laura Escobar
Keyword(s):  
Complete Graph ◽  
Piecewise Linear ◽  
Negative Answer ◽  
Linear Functions ◽  
One Dimension ◽  
Complete Graphs ◽  
Piecewise Linear Functions ◽  
Linear Spaces ◽  
International Audience ◽  
Tropical Linear Space

International audience Given a fan $\Delta$ and a cone $\sigma \in \Delta$ let $star^1(\sigma )$ be the set of cones that contain $\sigma$ and are one dimension bigger than $\sigma$ . In this paper we study two cones of piecewise linear functions defined on $\delta$ : the cone of functions which are convex on $star^1(σ\sigma)$ for all cones, and the cone of functions which are convex on $star^1(σ\sigma)$ for all cones of codimension 1. We give nice combinatorial descriptions for these two cones given two different fan structures on the tropical linear space of complete graphs. For the complete graph $K_5$, we prove that with the finer fan subdivision the two cones are not equal, but with the coarser subdivision they are the same. This gives a negative answer to a question of Gibney-Maclagan that for the finer subdivision the two cones are the same. Soit $\Delta$ un fan, pour $\sigma \in \Delta$ nous définissons $star^1(\sigma )$ comme l'ensemble de cônes qui contiennent $\sigma$ dont la dimension est un de plus que la dimension de $\sigma$ . Nous étudions deux cônes d'applications linéaires par morceaux définis sur $\Delta$ : le cône de fonctions convexes sur$star^1(\sigma )$, où $\sigma \in \Delta$ est un cône quelconque, et le cône de fonctions convexes sur $star^1(σ\sigma)$ où σ est un cône de codimension 1. étant donnés deux structures sur l'espace tropical linéaire de graphes complets, nous donnons de beaux descriptions combinatoires des cônes décrits en haut. Pour le graphe complet $K_5$, on démontre que avec la subdivision en fans plus fine, les deux cônes sont différentes, mais avec la subdivision plus gros ils sont cônes sont les mêmes. Ce résultant réponde négativement une question de Gibney-Maclagan.

scholarly journals Toppling numbers of complete and random graphs

2014 ◽  
Vol Vol. 16 no. 3 (Graph Theory) ◽  
Author(s):  
Anthony Bonato ◽  
William B. Kinnersley ◽  
Pawel Pralat
Keyword(s):  
Graph Theory ◽  
Differential Equations ◽  
Random Graphs ◽  
Complete Graph ◽  
Complete Graphs ◽  
Asymptotic Bounds ◽  
Large N ◽  
Chip Firing ◽  
International Audience ◽  
Person Game

Graph Theory International audience We study a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one chip to each neighbour; this may in turn cause other vertices to fire. The game ends when vertices continue firing forever. Min seeks to minimize the number of chips played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the toppling number of a graph G, and is denoted by t(G). By considering strategies for both players and investigating the evolution of the game with differential equations, we provide asymptotic bounds on the toppling number of the complete graph. In particular, we prove that for sufficiently large n 0.596400 n2 < t(Kn) < 0.637152 n2. Using a fractional version of the game, we couple the toppling numbers of complete graphs and the binomial random graph G(n,p). It is shown that for pn ≥n² / √ log(n) asymptotically almost surely t(G(n,p))=(1+o(1)) p t(Kn).

scholarly journals Multicolored isomorphic spanning trees in complete graphs

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Gregory Constantine
Keyword(s):  
Complete Graph ◽  
Spanning Trees ◽  
Complete Graphs ◽  
Edge Disjoint ◽  
International Audience

International audience Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors in such a way that the edges can be partitioned into edge disjoint colorful isomorphic spanning trees? A spanning treee is colorful if all n-1 colors occur among its edges. It is proved that this is possible to accomplish whenever n is a power of two, or five times a power of two.

Cycle Coloring and 2-Factorizations of KV

2011 ◽  
Vol 204-210 ◽  
pp. 1934-1937
Author(s):  
Xiao Yi Li ◽  
Zhao Di Xu ◽  
Wan Xi Chou
Keyword(s):  
Complete Graph ◽  
Complete Graphs ◽  
Whole Process ◽  
Basic Ideas ◽  
Definition Of

This paper give a definition of edge matrix and cycle coloring with complete graph , and also a construction of the theorem for n Hamilton. Clarify the basic ideas of 2-factorizations with complete graph, and proof the theorem of 2-factorization. After that, we show the whole process of the complete graphs 2-factorization for K10 and K17, when it is that n=5 and n=8. We obtain the edge matrix of the K17 and edge sets for 8 Hamilton. Finally, it can be test and verify the construction of theorem with n Hamilton, and theorem of 2-factorizations is a simple and feasible effectiveness method.

Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties

1969 ◽  
Vol 21 ◽  
pp. 992-1000 ◽  
Author(s):  
L. W. Beineke
Keyword(s):  
Projective Plane ◽  
Complete Graph ◽  
Planar Graphs ◽  
Complete Graphs ◽  
Minimum Number ◽  
Double Torus

Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus, and the projective plane, a single proof will be given to provide the solutions. The same questions will also be answered for bicomplete graphs.

scholarly journals Strong chromatic index of products of graphs

2007 ◽  
Vol Vol. 9 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Olivier Togni
Keyword(s):  
Cartesian Product ◽  
Complete Graphs ◽  
Chromatic Index ◽  
Induced Matching ◽  
Colour Class ◽  
Strong Chromatic Index ◽  
Minimum Number ◽  
International Audience

Graphs and Algorithms International audience The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for strong chromatic index of three different products of graphs in term of the strong chromatic index of each factor. For the cartesian product of paths, cycles or complete graphs, we derive sharper results. In particular, strong chromatic indices of d-dimensional grids and of some toroidal grids are given along with approximate results on the strong chromatic index of generalized hypercubes.

scholarly journals Random assignment and shortest path problems

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Johan Wästlund
Keyword(s):  
Limit Theorem ◽  
Shortest Path ◽  
Complete Graph ◽  
Assignment Problem ◽  
Shortest Path Problem ◽  
Random Assignment ◽  
Shortest Path Problems ◽  
Parisi Formula ◽  
International Audience ◽  
Random Assignment Problem

International audience We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.

scholarly journals INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS

2012 ◽  
Vol 21 (07) ◽  
pp. 1250065 ◽  
Author(s):  
THOMAS FLEMING
Keyword(s):  
Complete Graph ◽  
Cartesian Product ◽  
Complete Graphs ◽  
Linking Number ◽  
A Minor

We construct a graph G such that any embedding of G into R3 contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nontrivial knots. We then turn our attention to complete graphs and show that for any given n, every embedding of a large enough complete graph contains a 2-component link whose linking number is a nonzero multiple of n. Finally, we show that if a graph is a Cartesian product of the form G × K2, it is intrinsically linked if and only if G contains one of K5, K3,3 or K4,2 as a minor.

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP

1996 ◽  
Vol 5 (3) ◽  
pp. 297-306 ◽  
Author(s):  
Rachid Saad
Keyword(s):  
Complete Graph ◽  
Strong Evidence ◽  
General Setting ◽  
Maximum Length ◽  
Sufficient Condition ◽  
Complete Graphs ◽  
Random Polynomial ◽  
Exact Matching ◽  
Matching Problem ◽  
Bipartite Tournament

Jackson [10] gave a polynomial sufficient condition for a bipartite tournament to contain a cycle of a given length. The question arises as to whether deciding on the maximum length of a cycle in a bipartite tournament is polynomial. The problem was considered by Manoussakis [12] in the slightly more general setting of 2-edge coloured complete graphs: is it polynomial to find a longest alternating cycle in such coloured graphs? In this paper, strong evidence is given that such an algorithm exists. In fact, using a reduction to the well known exact matching problem, we prove that the problem is random polynomial.

scholarly journals Largest cliques in connected supermagic graphs

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Anna Lladó
Keyword(s):  
Complete Graph ◽  
Additional Condition ◽  
Induced Subgraph ◽  
Sidon Sets ◽  
International Audience ◽  
Integer Labeling

International audience A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \to [1, |V \cup E|]$ such that $f(x)+f(y)+f(xy)$ is constant for all edges $xy \in E$. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most $3n^2+o(n^2)$ which contain a complete graph of order $n$. Bounds on Sidon sets show that the order of such a graph is at least $n^2+o(n^2)$. We close the gap between those two bounds by showing that, for any given graph $H$ of order $n$, there are connected magic graphs of order $n^2+o(n^2)$ containing $H$ as an induced subgraph. Moreover it can be required that the graph admits a supermagic labelling $f$, which satisfies the additional condition $f(V)=[1,|V|]$.

Sign in / Sign up

Export Citation Format

Share Document