论文部分内容阅读
Qnis the n-cube.V(Qn) all binary n-tuples.Two vertices joined by an edge iffdiffer in precisely one coordinate.
Maximum density of copies of a graph in the n-cube
【摘 要】
：
Qnis the n-cube.V(Qn) all binary n-tuples.Two vertices joined by an edge iffdiffer in precisely one coordinate.
【机 构】
：
WestVirginiaUniversity
【出 处】
：
2015 Workshop on Combinatorics(2015组合论学术研讨会)
【发表日期】
：
2015年5期
其他文献
Let A1,...,Am be nonnegative matrices.d×d-matrices.Do they have a product,which is strictly positive? NO:The matrices may have a common invariant subspace
会议
Let D be a digraph.A state is a subset of D.Let x be a state and v a vertex v.If v ∈ x,then the state x cangoes to the state
会议
Synchronizing automata Definition:A(complete deterministic) automaton is synchronizing if there is a sequence of colors such that all the paths compatible with
会议
In 1976 Cameron et al.showed that a connected graph with smallest eigenvalue at least-2 is either a generalized line graph or the number of vertices is boun
会议
Spherical t-design on Sn-1 Aninempty finite subset X≤Sn-1 is called a spherical t-design
会议
HOMOMORPHISMS STRUCTURAL RAMSEY THEORY LIMITS JAROSLAV NE(S)ET(R)IL CHARLES UNIVERSITY PRAGVE
会议
A classic theorem of Euclidean geometry,often attributed as a De Bruijn-Erd?s theorem,asserts that any noncollinear set of n points in the plane determines
会议
Contents Back ground and problem Probability model of range difference Fisher information Optimal ring formation of sensors Numerical result Conclusion
会议
Jung-Chao Ban,Wen-Guei Hu,Song-Sun Lin and Yin-Heng Lin,Zeta functions for two-dimensional shifts of finite type,Memoirs of the American Mathematical Society,Vo
会议
FINITE RAMSEY THCOREM FOR EVERY PARTITION THERE EXISTS SUCH THAT
会议