Using block designs in crossing number bounds
نویسندگان
چکیده
منابع مشابه
Incidence Bounds for Block Designs
We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of incidences between points and m-flats in affine geometries over finite fields. First, we show an upper bound on the number of incidences between sufficiently l...
متن کاملOn the number of indecomposable block designs
A t-(v; k;) design D is a system (multiset) of k-element subsets (called blocks) of a v-element set V such that every t-element subset of V occurs exactly times in the blocks of D. A t-(v; k;) design D is called inde-composable (or elementary) if and only if there is no subsystem which is a t-(v; k; 0) design with 0 < 0 <. It is known that the number of inde-composable designs for given paramet...
متن کاملCrossing Number Bounds for the Mesh of Trees
Crossing number bounds for the mesh of trees graph are derived.
متن کاملGeneral Lower Bounds for the Minor Crossing Number of Graphs
There are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. In this contribution, we present their adaptations to the minor crossing number. Using the adapted bounds, we improve on the known bounds on the minor crossing number of hypercubes. We also point out relations of the minor crossing number to strin...
متن کاملImproved Bounds on the Crossing Number of Butterfly Network
The crossing number cr(G) of a graph G is the minimum number of crossings of its edges among all drawings of G in the plane. It is an important measure of the non-planarity of a graph [12], with applications in discrete and computational geometry [11]. The crossing number of a graph corresponding to the VLSI circuit has strong influence on the area layout as well as on the number of wire contac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2019
ISSN: 1063-8539,1520-6610
DOI: 10.1002/jcd.21665