Lines in Metric Spaces and Hypergraphs

来源 :2015 Workshop on Combinatorics(2015组合论学术研讨会) | 被引量 : 0次 | 上传用户:dddbj126
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  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 at least n distinct lines.Chen and Chvátal conjectured that this holds for an arbitrary finite metric space,with a certain natural definition of lines in a metric space.The form has special cases in restricted metric spaces,spaces generated by graphs,as well as more general situations in hypergraphs.We will survey the most recent results and their proof techniques.
其他文献
Outline A new Universality argument of argument of homomorphism Orders Universality DefinitionA partial order(P,≤p) can be embedded into a partial order
会议
Outline Why minimize energy?Delsarte-Yudin LP approach DGS bounds for spherical τ -desings Levenshtein bounds for codes
会议
Kelman(1981) and Csikv ari(2010) studied a kind of transformationbetween trees.T1 > T2 if T1 can be obtained from T2 by KCtransformation.
会议
Definition 1(Ei.Bannai and Et.Bannai,2012)Let(Y;w) be a weighted subset of X with positive function w on Y.
会议
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
会议