共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we consider -cycle decomposition of
and directed -cycle decompositions of and , where and denote the wreath product and tensor product of graphs, respectively. Using the results obtained here, we prove that for , the obvious necessary conditions for the existence of a -decomposition of are sufficient whenever where is a prime and . Also, we show that the necessary conditions for the existence of -decompositions of and are sufficient whenever is a prime, where denotes the directed cycle of length . 相似文献
2.
Aysel Erey 《Discrete Mathematics》2018,341(5):1419-1431
3.
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. A -matching in a 3-uniform hypergraph is a matching of size . Let be a partition of vertices such that and . Denote by the 3-uniform hypergraph with vertex set consisting of all those edges which contain at least two vertices of . Let be a 3-uniform hypergraph of order such that for any two adjacent vertices . In this paper, we prove contains a -matching if and only if is not a subgraph of . 相似文献
4.
Motivated by the relation , holding for the -generalized Catalan numbers of type and , the connection between dominant regions of the -Shi arrangement of type and is investigated. More precisely, it is explicitly shown how copies of the set of dominant regions of the -Shi arrangement of type , biject onto the set of type such regions. This is achieved by exploiting two different viewpoints of the representative alcove of each region: the Shi tableau and the abacus diagram. In the same line of thought, a bijection between copies of the set of -Dyck paths of height
and the set of lattice paths inside an rectangle is provided. 相似文献
5.
6.
For a subgraph of , let be the maximum number of vertices of that are pairwise distance at least three in . In this paper, we prove three theorems. Let be a positive integer, and let be a subgraph of an -connected claw-free graph . We prove that if , then either can be covered by a cycle in , or there exists a cycle in such that . This result generalizes the result of Broersma and Lu that has a cycle covering all the vertices of if . We also prove that if , then either can be covered by a path in , or there exists a path in such that . By using the second result, we prove the third result. For a tree , a vertex of with degree one is called a leaf of . For an integer , a tree which has at most leaves is called a -ended tree. We prove that if , then has a -ended tree covering all the vertices of . This result gives a positive answer to the conjecture proposed by Kano et al. (2012). 相似文献
7.
Let be a prime power and be a positive integer. A subspace partition of , the vector space of dimension over , is a collection of subspaces of such that each nonzero vector of is contained in exactly one subspace in ; the multiset of dimensions of subspaces in is then called a Gaussian partition of . We say that contains a direct sum if there exist subspaces such that . In this paper, we study the problem of classifying the subspace partitions that contain a direct sum. In particular, given integers and with , our main theorem shows that if is a subspace partition of with subspaces of dimension for , then contains a direct sum when has a solution for some integers and belongs to the union of two natural intervals. The lower bound of captures all subspace partitions with dimensions in that are currently known to exist. Moreover, we show the existence of infinite classes of subspace partitions without a direct sum when or when the condition on the existence of a nonnegative integral solution is not satisfied. We further conjecture that this theorem can be extended to any number of distinct dimensions, where the number of subspaces in each dimension has appropriate bounds. These results offer further evidence of the natural combinatorial relationship between Gaussian and integer partitions (when ) as well as subspace and set partitions. 相似文献
8.
9.
Jeong-Hyun Kang 《Discrete Mathematics》2018,341(1):96-103
The vertices of Kneser graph are the subsets of of cardinality , two vertices are adjacent if and only if they are disjoint. The square of a graph is defined on the vertex set of with two vertices adjacent if their distance in is at most 2. Z. Füredi, in 2002, proposed the problem of determining the chromatic number of the square of the Kneser graph. The first non-trivial problem arises when . It is believed that where is a constant, and yet the problem remains open. The best known upper bounds are by Kim and Park: for 1 (Kim and Park, 2014) and for (Kim and Park, 2016). In this paper, we develop a new approach to this coloring problem by employing graph homomorphisms, cartesian products of graphs, and linear congruences integrated with combinatorial arguments. These lead to , where is a constant in , depending on . 相似文献
10.
11.
A graph is minimally -tough if the toughness of is and the deletion of any edge from decreases the toughness. Kriesell conjectured that for every minimally -tough graph the minimum degree . We show that in every minimally -tough graph . We also prove that every minimally -tough, claw-free graph is a cycle. On the other hand, we show that for every positive rational number any graph can be embedded as an induced subgraph into a minimally -tough graph. 相似文献
12.
In this paper, we employed lattice model to describe the three internally vertex-disjoint paths that span the vertex set of the generalized Petersen graph . We showed that the is 3-spanning connected for odd . Based on the lattice model, five amalgamated and one extension mechanisms are introduced to recursively establish the 3-spanning connectivity of the . In each amalgamated mechanism, a particular lattice trail was amalgamated with the lattice trails that was dismembered, transferred, or extended from parts of the lattice trails for , where a lattice tail is a trail in the lattice model that represents a path in . 相似文献
13.
Given a nonnegative integer and a positive integer , a graph is said to be -colorable if the vertices of can be colored with colors such that every vertex has at most neighbors receiving the same color as itself. Let be the family of planar graphs without -cycles adjacent to cycles of length 3 or 5. This paper proves that everyone in is -colorable. This is the best possible in the sense that there are members in which are not -colorable. 相似文献
14.
Greg Malen 《Discrete Mathematics》2018,341(9):2567-2574
For any fixed graph , we prove that the topological connectivity of the graph homomorphism complex Hom() is at least , where , for the minimum degree of a vertex in a subgraph . This generalizes a theorem of C?uki? and Kozlov, in which the maximum degree was used in place of , and provides a high-dimensional analogue of the graph theoretic bound for chromatic number, , as . Furthermore, we use this result to examine homological phase transitions in the random polyhedral complexes Hom when for a fixed constant . 相似文献
15.
Tathagata Basak 《Journal of Pure and Applied Algebra》2018,222(10):3036-3042
16.
Let and be two positive integers such that and . A graph is an -parity factor of a graph if is a spanning subgraph of and for all vertices , and . In this paper we prove that every connected graph with vertices has an -parity factor if is even, , and for any two nonadjacent vertices , . This extends an earlier result of Nishimura (1992) and strengthens a result of Cai and Li (1998). 相似文献
17.
Haiyang Zhu Lianying Miao Sheng Chen Xinzhong Lü Wenyao Song 《Discrete Mathematics》2018,341(8):2211-2219
Let be the set of all positive integers. A list assignment of a graph is a function that assigns each vertex a list for all . We say that is --choosable if there exists a function such that for all , if and are adjacent, and if and are at distance 2. The list--labeling number of is the minimum such that for every list assignment , is --choosable. We prove that if is a planar graph with girth
and its maximum degree is large enough, then . There are graphs with large enough and having . 相似文献
18.
Francisco Arias Javier de la Cruz Joachim Rosenthal Wolfgang Willems 《Discrete Mathematics》2018,341(10):2729-2734
In this paper we prove that rank metric codes with special properties imply the existence of -analogs of suitable designs. More precisely, we show that the minimum weight vectors of a dually almost MRD code which has no code words of rank weight form a -Steiner system . This is the q-analog of a result in classical coding theory and it may be seen as a first step to prove a q-analog of the famous Assmus–Mattson Theorem. 相似文献
19.
For integers , a -coloring of a graph is a proper coloring with at most colors such that for any vertex with degree , there are at least min different colors present at the neighborhood of . The -hued chromatic number of , , is the least integer such that a -coloring of exists. The list-hued chromatic number of is similarly defined. Thus if , then . We present examples to show that, for any sufficiently large integer , there exist graphs with maximum average degree less than 3 that cannot be -colored. We prove that, for any fraction , there exists an integer such that for each , every graph with maximum average degree is list -colorable. We present examples to show that for some there exist graphs with maximum average degree less than 4 that cannot be -hued colored with less than colors. We prove that, for any sufficiently small real number , there exists an integer such that every graph with maximum average degree satisfies . These results extend former results in Bonamy et al. (2014). 相似文献