共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we consider the question of when a strongly regular graph with parameters can exist. A strongly regular graph with such parameters is called a pseudo-generalized quadrangle. A pseudo-generalized quadrangle can be derived from a generalized quadrangle, but there are other examples which do not arise in this manner. If the graph is derived from a generalized quadrangle then and , while for pseudo-generalized quadrangles we still have the former bound but not the latter. Previously, Neumaier has proved a bound for which is cubic in , but we improve this to one which is quadratic. The proof involves a careful analysis of cliques and cocliques in the graph. This improved bound eliminates many potential parameter sets which were otherwise feasible. 相似文献
2.
《Discrete Mathematics》2019,342(4):1028-1037
For a given pair of two graphs , let be the smallest positive integer such that for any graph of order , either contains as a subgraph or the complement of contains as a subgraph. Baskoro, Broersma and Surahmat (2005) conjectured that for , where is the join of and . In this paper, we prove that this conjecture is true for the case . 相似文献
3.
4.
《Discrete Mathematics》2019,342(4):1017-1027
We study the independence number of a product of Kneser graph with itself, where we consider all four standard graph products. The cases of the direct, the lexicographic and the strong product of Kneser graphs are not difficult (the formula for is presented in this paper), while the case of the Cartesian product of Kneser graphs is much more involved. We establish a lower bound and an upper bound for the independence number of , which are asymptotically tending to and , respectively. The former is obtained by a construction, which differs from the standard diagonalization procedure, while for the upper bound the -independence number of Kneser graphs can be applied. We also establish some constructions in odd graphs , which give a lower bound for the 2-independence number of these graphs, and prove that two such constructions give the same lower bound as a previously known one. Finally, we consider the -stable Kneser graphs , derive a formula for their -independence number, and give the exact value of the independence number of the Cartesian square of . 相似文献
5.
6.
We compute the number of (weak) equivalence classes of branched covers from a surface of genus to the sphere, with 3 branching points, degree , and local degrees over the branching points of the form , , , for several values of and . We obtain explicit formulae of arithmetic nature in terms of the local degrees . Our proofs employ a combinatorial method based on Grothendieck’s dessins d’enfant. 相似文献
7.
8.
9.
Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph , , which is properly colored with colors, the edge set can be partitioned into edge disjoint rainbow spanning trees (where a graph is said to be rainbow if its edges have distinct colors). Constantine (2002) strengthened this conjecture asking the rainbow spanning trees to be pairwise isomorphic. He also showed an example satisfying his conjecture for every . Caughmann, Krussel and Mahoney (2017) recently showed a first infinite family of edge colorings for which the conjecture of Brualdi and Hollingsworth can be verified. In the present paper, we extend this result to all edge-colorings arising from cyclic 1-factorizations of constructed by Hartman and Rosa (1985). Finally, we remark that our constructions permit to extend Constatine’s result also to all . 相似文献
10.
11.
We give exact growth rates for the number of bipartite graceful permutations of the symbols that start with for (equivalently, -labelings of paths with vertices that have as a pendant label). In particular, when the growth is asymptotically like for . The number of graceful permutations of length grows at least this fast, improving on the best existing asymptotic lower bound of . Combined with existing theory, this improves the known lower bounds on the number of Hamiltonian decompositions of the complete graph and on the number of cyclic oriented triangular embeddings of and . We also give the first exponential lower bound on the number of R-sequencings of . 相似文献
12.
13.
In this paper, we consider the following nonlinear elliptic equation involving the fractional Laplacian with critical exponent: where and , is periodic in with . Under some natural conditions on K near a critical point, we prove the existence of multi-bump solutions where the centers of bumps can be placed in some lattices in , including infinite lattices. On the other hand, to obtain positive solution with infinite bumps such that the bumps locate in lattices in , the restriction on is in some sense optimal, since we can show that for , no such solutions exist. 相似文献
14.
《Discrete Mathematics》2020,343(12):112083
For a finite abelian group , the generalized Erdős–Ginzburg–Ziv constant is the smallest such that a sequence of elements in always contains a -element subsequence which sums to zero. If is the exponent of , the previously best known bounds for were linear in and when . Via a probabilistic argument, we produce the exponential lower bound for . For the general case, we show 相似文献
15.
16.
In 2009, Kyaw proved that every -vertex connected -free graph with contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected -free graphs. We show that every -vertex connected -free graph with contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “” is best possible. 相似文献
17.
18.
19.
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes and of size and , respectively, and whose edge set consists of all the triples containing at least two vertices of . Let be a 3-uniform hypergraph of order with no isolated vertex and for any two adjacent vertices . In this paper, we show that contains a matching of size if and only if is not a subgraph of . This result improves our previous one in Zhang and Lu (2018). 相似文献