Euler cycles in the complete graph K2m+1
نویسندگان
چکیده
منابع مشابه
Cyclically decomposing the complete graph into cycles
Let m1; m2; : : : ; mk be positive integers not less than 3 and let n= ∑k i=1 mi. Then, it is proved that the complete graph of order 2n+ 1 can be cyclically decomposed into k(2n+ 1) cycles such that, for each i= 1; 2; : : : ; k, the cycle of length mi occurs exactly 2n+ 1 times. c © 2003 Elsevier B.V. All rights reserved.
متن کاملLabeling the complete bipartite graph with no zero cycles
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such codes in grid topologies and gave a combinatorial characterization for it. Consider a labeling of the edges of the complete bipartite graph Kn,n with labels...
متن کاملMaximum packings of the complete graph with uniform length cycles
In this paper we find the maximum number of pairwise edge-disjoint mcycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.
متن کاملThe Euler system of generalized Heegner cycles
In this thesis, we study the Selmer group of the p-adic étale realization of certain motives using Kolyvagin’s method of Euler systems [34]. In Chapter 3, we use an Euler system of Heegner cycles to bound the Selmer group associated to a modular form of higher even weight twisted by a ring class character. This is an extension of Nekovář’s result [39] that uses Bertolini and Darmon’s refinement...
متن کاملEuler index in uncertain graph
As the complexity of a system increases, in practical application of graph theory, different types of uncertainty are frequently encountered. In an uncertain graph, whether two vertices of the graph are joined cannot be completely determined. Within the framework of uncertainty theory, the concept of Euler index of uncertain graph is proposed. It also gives a method to calculate Euler index of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00074-x