搜索结果: 1-8 共查到“组合数学 F-regular”相关记录8条 . 查询时间(0.062 秒)
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
4-regular graph circuit partition Euler system interlacement
2012/4/18
Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement mat...
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
Hamilton decompositions regular expanders Kelly's conjecture large tournaments
2012/2/29
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we p...
Strongly Regular Cayley Graphs, Skew Hadamard Difference Sets, and Rationality of Relative Gauss Sums
strongly regular graph skew Hadamard difference set relative Gauss sum
2012/3/1
In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and our results ...
Inscribing a regular octahedron into polytopes
inscribed polytopes spheric geometry Combinatorics
2011/9/19
Abstract: We prove that any simple polytope (and some non-simple polytopes) in $\mathbb R^3$ admits an inscribed regular octahedron.
Classification of nonorientable regular embeddings of Hamming graphs
Graph embeddings regular embeddings regular map Hamming graphs
2011/9/9
Abstract: By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we cl...
A catalogue of small regular matroids and their Tutte polynomials
catalogue of small regular matroids Tutte polynomials Combinatorics
2011/8/29
Abstract: A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are s...
Abstract: We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B_3(q) induced on the vertices far from a fixed point, and the subgraph of the dual ...
Tail behavior of stationary solutions of random difference equations: the case of regular matrices
Markov renewal theory implicit renewal theory Harris recurrence
2010/12/1
Given a sequence (Mn,Qn)n≥1 of i.i.d. random variables with generic copy (M,Q)such that M is a regular d × d matrix and Q takes values in Rd, we consider the random difference equation (RDE) Rn = MnRn...