DOCSLIB.ORG

Using Graphs to Find Optimal Block Designs Abstract Conference On

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Using Graphs to Find Optimal Block Designs Abstract Conference On Abstract Ching-Shui Cheng was one of the pioneers Using graphs to find optimal block designs of using graph theory to prove results about optimal incomplete-block designs. There are actually two graphs associated with an incomplete-block design, and R. A. Bailey either can be used. University of St Andrews / QMUL (emerita) A block design is D-optimal if it maximizes the number of spanning trees; it is A-optimal if it minimizes the total of the Special session for Ching-Shui Cheng, pairwise resistances when the graph is thought of as an 20 June 2013 electrical network. I shall report on some surprising results about optimal designs when replication is very low. 1/44 2/44 Conference on Design of Experiments, Tianjin, June 2006 Problem 1: Factorial design Problem There are several treatment factors, with various numbers of levels. There may not be room to include all combinations of these levels. There are several inherent factors (also called block factors) on the experimental units. The inherent factors may pose some constraints on how treatment factors can be applied. So how do we set about designing the experiment? Solution Use Desmond Patterson’s design key. 3/44 4/44 Problem 2: Optimal incomplete-block design Two papers about the second problem Problem I Ch’ing Shui Cheng:ˆ The design must be in blocks, but each block is too small to Maximizing the total number of spanning trees in a graph: contain every treatment. two related problems in graph theory and optimum design We want variance to be small, as measured by the D-criterion theory. (minimizing the volume of the ellpsoid of confidence). Journal of Combinatorial Theory, Series B 31 (1981), 240–248. How do we set about finding a D-optimal block design? I Ching-Shui Cheng: Solution Graph and optimum design theories—some connections Represent the incomplete-block design as a graph and examples. (with vertices and edges), Bulletin of the International Statistical Institute 49 (1981), and maximize the number of spanning trees in the graph. part 1, 580–590. 5/44 6/44 Some early papers Two memorial conferences for R. C. Bose, India, 1988 Year RAB CSC 1977 factorial (design key) 1978 factorial (design key) optimal IBDs Calcutta meeting on : 1979 optimal IBDs Combinatorial Mathematics and Applications CSC spoke on “On the optimality of (M.S)-optimal designs in 1980 optimal IBDs; factorial large systems”. 1981 optimal IBDs and graphs 1982 factorial Delhi meeting on Probability, Statistics and Design of Experiments: 1984 IBDs RAB spoke on “Cyclic designs and factorial designs”. 1985 factorial; IBDs IBDs and graphs; factorial with trend 1986 IBDs IBDs 1988 factorial with trend 1989 factorial 7/44 8/44 Two joint papers Some later papers and books Year RAB CSC 1993 factorial; optimal IBDs 1995 optimal IBDs 1998 factorial; BIBDs I C.-S. Cheng and R. A. Bailey: 1999 factorial Optimality of some two-associate-class partially balanced 2000 factorial incomplete-block designs. 2001 factorial Annals of Statistics 19 (1991), 1667–1671. 2002 factorial I R. A. Bailey, Ching-Shui Cheng and Patricia Kipnis: 2003 factorial Construction of trend-resistant factorial designs. 2004 IBDs factorial Statistica Sinica 2 (1992), 393–411. 2005 IBDs factorial 2006 factorial 2007 optimal IBDs and graphs 2009 optimal IBDs and graphs factorial 2011 factorial factorial 2013 optimal IBDs and graphs factorial (design key) 9/44 10/44 With Jo Kunert, Dortmund, April 2009 What makes a block design good for experiments? I have v treatments that I want to compare. I have b blocks. Each block has space for k treatments (not necessarily distinct). How should I choose a block design? 11/44 12/44 Two designs with v = 5, b = 7, k = 3: which is better? Two designs with v = 15, b = 7, k = 3: which is better? Conventions: columns are blocks; order of treatments within each block is irrelevant; 1 1 2 3 4 5 6 1 1 1 1 1 1 1 order of blocks is irrelevant. 2 4 5 6 10 11 12 2 4 6 8 10 12 14 3 7 8 9 13 14 15 3 5 7 9 11 13 15 1 1 1 1 2 2 2 1 1 1 1 2 2 2 2 3 3 4 3 3 4 1 3 3 4 3 3 4 replications differ by 1 queen-bee design 3 4 5 5 4 5 5 2 4 5 5 4 5 5 ≤ The replication of a treatment is its number of occurrences. binary non-binary A design is a queen-bee design if there is a treatment that A design is binary if no treatment occurs more than once in any occurs in every block. block. 13/44 14/44 Experimental units and incidence matrix Levi graph There are bk experimental units. If ω is an experimental unit, put The Levi graph G˜ of a block design ∆ has f (ω) = treatment on ω I one vertex for each treatment, g(ω) = block containing ω. I one vertex for each block, I one edge for each experimental unit, For i = 1, . , v and j = 1, . , b, let with edge ω joining vertex f (ω) to vertex g(ω). n = ω : f (ω) = i and g(ω) = j ij |{ }| It is a bipartite graph, = number of experimental units in block j which have with nij edges between treatment-vertex i and block-vertex j. treatment i. The v b incidence matrix N has entries n . × ij 15/44 16/44 Example 1: v = 4, b = k = 3 Example 2: v = 8, b = 4, k = 3 1 2 1 1 2 3 4 3 3 2 2 3 4 1 4 4 2 5 6 7 8 5 8 1 4 x ¨H @ ¨ H @ @ ¨¨ x HH x x @ ¨¨ HH 2 HH ¨¨ x H1 2¨ HxH ¨¨ x 4 H¨ @ @ x@ @ 3 x x63 x 7 x 17/44 18/44 Concurrence graph Example 1: v = 4, b = k = 3 1 2 1 The concurrence graph G of a block design ∆ has 3 3 2 I one vertex for each treatment, 4 4 2 I one edge for each unordered pair α, ω, with α = ω, 6 g(α) = g(ω) and f (α) = f (ω): 6 1 2 this edge joins vertices f (α) and f (ω). 4 ¨H ¨ H @ ¨¨ x HH x@ x There are no loops. ¨¨ HH @ H ¨ HH ¨¨ @ If i = j then the number of edges between vertices i and j is 1Hx¨2 x @ 6 HH¨¨ @ b 3x 3x 4x λij = ∑ nisnjs; s=1 Levi graph concurrence graph this is called the concurrence of i and j, can recover design may have more symmetry and is the (i, j)-entry of Λ = NN>. more vertices more edges if k = 2 more edges if k 4 19/44 ≥ 20/44 Example 2: v = 8, b = 4, k = 3 Laplacian matrices The Laplacian matrix L of the concurrence graph G is a 1 2 3 4 v v matrix with (i, j)-entry as follows: 2 3 4 1 × I if i = j then 5 6 7 8 6 L = (number of edges between i and j) = λ ; ij − − ij I Lii = valency of i = ∑ λij. j=i 5 5 6 8 1 x ¡A The Laplacian matrix L˜ of the Levi graph G˜ is a @ ¡ xA (v + b) (v + b) matrix with (i, j)-entry as follows: @ @ 1¡ A 2 x x @ ¨ H ˜ × 2 ¨ H I Lii = valency of i ¨ x x H x 8HH ¨¨ 6 k if i is a block xH ¨ x = 4 A ¡ @ @ 4 3 (replication ri of i if i is a treatment x@ @ xA ¡ x A¡ I if i = j then Lij = (number of edges between i and j) 6 − x63 x 7 7x 0 if i and j are both treatments x Levi graph concurrence graph = 0 if i and j are both blocks nij if i is a treatment and j is a block, or vice versa. 21/44 − 22/44 Connectivity Generalized inverse All row-sums of L and of L˜ are zero, so both matrices have 0 as eigenvalue on the appropriate all-1 vector. Under the assumption of connectivity, the Moore–Penrose generalized inverse L− of L is defined by Theorem 1 The following are equivalent. 1 − 1 L− = L + J J , v v − v v 1. 0 is a simple eigenvalue of L; 2. G is a connected graph; where J is the v v all-1 matrix. v × 3. G˜ is a connected graph; 1 (The matrix J is the orthogonal projector onto the null space 4. 0 is a simple eigenvalue of L;˜ v v of L.) 5. the design ∆ is connected in the sense that all differences between treatments can be estimated. The Moore–Penrose generalized inverse L˜ − of L˜ is defined similarly. From now on, assume connectivity. Call the remaining eigenvalues non-trivial. They are all non-negative. 23/44 24/44 Estimation and variance How do we calculate variance? We measure the response Yω on each experimenal unit ω. If experimental unit ω has treatment i and is in block m Theorem (Standard linear model theory) (f (ω) = i and g(ω) = m), then we assume that Assume that all the noise is independent, with variance σ2. If x = 0, then the variance of the best linear unbiased estimator of Yω = τi + βm + random noise. ∑i i ∑i xiτi is equal to 2 (x>L−x)kσ . We want to estimate contrasts ∑ x τ with ∑ x = 0. i i i i i In particular, the variance of the best linear unbiased estimator of the simple difference τ τ is In particular, we want to estimate all the simple differences i − j τi τj.
Load more

Recommended publications
  • Configurations of Points and Lines
    Configurations of Points and Lines "RANKO'RüNBAUM 'RADUATE3TUDIES IN-ATHEMATICS 6OLUME !MERICAN-ATHEMATICAL3OCIETY http://dx.doi.org/10.1090/gsm/103 Configurations of Points and Lines Configurations of Points and Lines Branko Grünbaum Graduate Studies in Mathematics Volume 103 American Mathematical Society Providence, Rhode Island Editorial Board David Cox (Chair) Steven G. Krantz Rafe Mazzeo Martin Scharlemann 2000 Mathematics Subject Classification. Primary 01A55, 01A60, 05–03, 05B30, 05C62, 51–03, 51A20, 51A45, 51E30, 52C30. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-103 Library of Congress Cataloging-in-Publication Data Gr¨unbaum, Branko. Configurations of points and lines / Branko Gr¨unbaum. p. cm. — (Graduate studies in mathematics ; v. 103) Includes bibliographical references and index. ISBN 978-0-8218-4308-6 (alk. paper) 1. Configurations. I. Title. QA607.G875 2009 516.15—dc22 2009000303 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to [email protected]. c 2009 by the American Mathematical Society.
    [Show full text]
  • Levi Graphs and Concurrence Graphs As Tools to Evaluate Designs
    Levi graphs and concurrence graphs as tools to evaluate designs R. A. Bailey [email protected] The Norman Biggs Lecture, May 2012 1/35 What makes a block design good for experiments? I have v treatments that I want to compare. I have b blocks. Each block has space for k treatments (not necessarily distinct). How should I choose a block design? 2/35 Two designs with v = 5, b = 7, k = 3: which is better? Conventions: columns are blocks; order of treatments within each block is irrelevant; order of blocks is irrelevant. 1 1 1 1 2 2 2 1 1 1 1 2 2 2 2 3 3 4 3 3 4 1 3 3 4 3 3 4 3 4 5 5 4 5 5 2 4 5 5 4 5 5 binary non-binary A design is binary if no treatment occurs more than once in any block. 3/35 Two designs with v = 15, b = 7, k = 3: which is better? 1 1 2 3 4 5 6 1 1 1 1 1 1 1 2 4 5 6 10 11 12 2 4 6 8 10 12 14 3 7 8 9 13 14 15 3 5 7 9 11 13 15 replications differ by ≤ 1 queen-bee design The replication of a treatment is its number of occurrences. A design is a queen-bee design if there is a treatment that occurs in every block. 4/35 Two designs with v = 7, b = 7, k = 3: which is better? 1 2 3 4 5 6 7 1 2 3 4 5 6 7 2 3 4 5 6 7 1 2 3 4 5 6 7 1 4 5 6 7 1 2 3 3 4 5 6 7 1 2 balanced (2-design) non-balanced A binary design is balanced if every pair of distinct treaments occurs together in the same number of blocks.
    [Show full text]
  • The History of Degenerate (Bipartite) Extremal Graph Problems
    The history of degenerate (bipartite) extremal graph problems Zolt´an F¨uredi and Mikl´os Simonovits May 15, 2013 Alfr´ed R´enyi Institute of Mathematics, Budapest, Hungary [email protected] and [email protected] Abstract This paper is a survey on Extremal Graph Theory, primarily fo- cusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions. 1 Contents 1 Introduction 4 1.1 Some central theorems of the field . 5 1.2 Thestructureofthispaper . 6 1.3 Extremalproblems ........................ 8 1.4 Other types of extremal graph problems . 10 1.5 Historicalremarks . .. .. .. .. .. .. 11 arXiv:1306.5167v2 [math.CO] 29 Jun 2013 2 The general theory, classification 12 2.1 The importance of the Degenerate Case . 14 2.2 The asymmetric case of Excluded Bipartite graphs . 15 2.3 Reductions:Hostgraphs. 16 2.4 Excluding complete bipartite graphs . 17 2.5 Probabilistic lower bound . 18 1 Research supported in part by the Hungarian National Science Foundation OTKA 104343, and by the European Research Council Advanced Investigators Grant 267195 (ZF) and by the Hungarian National Science Foundation OTKA 101536, and by the European Research Council Advanced Investigators Grant 321104. (MS). 1 F¨uredi-Simonovits: Degenerate (bipartite) extremal graph problems 2 2.6 Classification of extremal problems . 21 2.7 General conjectures on bipartite graphs . 23 3 Excluding complete bipartite graphs 24 3.1 Bipartite C4-free graphs and the Zarankiewicz problem . 24 3.2 Finite Geometries and the C4-freegraphs .
    [Show full text]
  • On the Levi Graph of Point-Line Configurations 895
    inv lve a journal of mathematics On the Levi graph of point-line configurations Jessica Hauschild, Jazmin Ortiz and Oscar Vega msp 2015 vol. 8, no. 5 INVOLVE 8:5 (2015) msp dx.doi.org/10.2140/involve.2015.8.893 On the Levi graph of point-line configurations Jessica Hauschild, Jazmin Ortiz and Oscar Vega (Communicated by Joseph A. Gallian) We prove that the well-covered dimension of the Levi graph of a point-line configuration with v points, b lines, r lines incident with each point, and every line containing k points is equal to 0, whenever r > 2. 1. Introduction The concept of the well-covered space of a graph was first introduced by Caro, Ellingham, Ramey, and Yuster[Caro et al. 1998; Caro and Yuster 1999] as an effort to generalize the study of well-covered graphs. Brown and Nowakowski [2005] continued the study of this object and, among other things, provided several examples of graphs featuring odd behaviors regarding their well-covered spaces. One of these special situations occurs when the well-covered space of the graph is trivial, i.e., when the graph is anti-well-covered. In this work, we prove that almost all Levi graphs of configurations in the family of the so-called .vr ; bk/- configurations (see Definition 3) are anti-well-covered. We start our exposition by providing the following definitions and previously known results. Any introductory concepts we do not present here may be found in the books by Bondy and Murty[1976] and Grünbaum[2009]. We consider only simple and undirected graphs.
    [Show full text]
  • 7 Combinatorial Geometry
    7 Combinatorial Geometry Planes Incidence Structure: An incidence structure is a triple (V; B; ∼) so that V; B are disjoint sets and ∼ is a relation on V × B. We call elements of V points, elements of B blocks or lines and we associate each line with the set of points incident with it. So, if p 2 V and b 2 B satisfy p ∼ b we say that p is contained in b and write p 2 b and if b; b0 2 B we let b \ b0 = fp 2 P : p ∼ b; p ∼ b0g. Levi Graph: If (V; B; ∼) is an incidence structure, the associated Levi Graph is the bipartite graph with bipartition (V; B) and incidence given by ∼. Parallel: We say that the lines b; b0 are parallel, and write bjjb0 if b \ b0 = ;. Affine Plane: An affine plane is an incidence structure P = (V; B; ∼) which satisfies the following properties: (i) Any two distinct points are contained in exactly one line. (ii) If p 2 V and ` 2 B satisfy p 62 `, there is a unique line containing p and parallel to `. (iii) There exist three points not all contained in a common line. n Line: Let ~u;~v 2 F with ~v 6= 0 and let L~u;~v = f~u + t~v : t 2 Fg. Any set of the form L~u;~v is called a line in Fn. AG(2; F): We define AG(2; F) to be the incidence structure (V; B; ∼) where V = F2, B is the set of lines in F2 and if v 2 V and ` 2 B we define v ∼ ` if v 2 `.
    [Show full text]
  • Self-Dual Configurations and Regular Graphs
    SELF-DUAL CONFIGURATIONS AND REGULAR GRAPHS H. S. M. COXETER 1. Introduction. A configuration (mci ni) is a set of m points and n lines in a plane, with d of the points on each line and c of the lines through each point; thus cm = dn. Those permutations which pre­ serve incidences form a group, "the group of the configuration." If m — n, and consequently c = d, the group may include not only sym­ metries which permute the points among themselves but also reci­ procities which interchange points and lines in accordance with the principle of duality. The configuration is then "self-dual," and its symbol («<*, n<j) is conveniently abbreviated to na. We shall use the same symbol for the analogous concept of a configuration in three dimensions, consisting of n points lying by d's in n planes, d through each point. With any configuration we can associate a diagram called the Menger graph [13, p. 28],x in which the points are represented by dots or "nodes," two of which are joined by an arc or "branch" when­ ever the corresponding two points are on a line of the configuration. Unfortunately, however, it often happens that two different con­ figurations have the same Menger graph. The present address is concerned with another kind of diagram, which represents the con­ figuration uniquely. In this Levi graph [32, p. 5], we represent the points and lines (or planes) of the configuration by dots of two colors, say "red nodes" and "blue nodes," with the rule that two nodes differently colored are joined whenever the corresponding elements of the configuration are incident.
    [Show full text]
  • Algorithms and Computation in Mathematics • Volume 15
    Algorithms and Computation in Mathematics • Volume 15 Editors Arjeh M. Cohen Henri Cohen David Eisenbud Bernd Sturmfels Petteri Kaski Patric R.J. Östergård Classification Algorithms for Codes and Designs With 61 Figures and 30 Tables ABC Authors Petteri Kaski Department of Computer Science and Engineering Helsinki University of Technology P. O. Box 5400 2015 HUT, Helsinki Finland e-mail: petteri.kaski@hut.fi Patric R.J. Östergård Department of Electrical and Communications, Engineering Helsinki University of Technology P.O. Box 3000 2015 HUT, Helsinki Finland e-mail: patric.ostergard@hut.fi Library of Congress Control Number: 2005935445 Mathematics Subject Classification (2000): 05-02, 05Bxx, 05Cxx, 05E20, 51Exx, 68-02, 68Rxx, 94-02, 94Bxx ISSN 1431-1550 ISBN-10 3-540-28990-9 Springer Berlin Heidelberg New York ISBN-13 978-3-540-28990-6 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springeronline.com c Springer-Verlag Berlin Heidelberg 2006 Printed in The Netherlands The use of general descriptive names, registered names, trademarks, etc.
    [Show full text]
  • Fragments in Symmetric Configurations with Block Size 3
    Fragments in symmetric configurations with block size 3 Grahame Erskine∗∗ Terry Griggs∗ Jozef Sir´aˇnˇ †† [email protected] [email protected] [email protected] Abstract We begin the study of collections of three blocks which can occur in a symmetric configuration with block size 3, v3. Formulae are derived for the number of occurrences of these and it is shown that the triangle, i.e. abf, ace, bcd is a basis. It is also shown that symmetric configurations without triangles exist if and only if v = 15 or v ≥ 17. Such configurations containing “many” triangles are also discussed and a complete analysis of the triangle content of those with a cyclic automorphism is given. 1 Introduction In this paper we will be concerned with symmetric configurations with block size 3. First we recall the definitions. A configuration (vr, bk) is a finite incidence structure with v points and b blocks, with the property that there exist positive integers k and r such that (i) each block contains exactly k points; (ii) each point is contained in exactly r blocks; and (iii) any pair of distinct points is contained in at most one block. If v = b (and hence necessarily r = k), the configuration is called symmetric and is usually denoted by vk. We are interested in the case where k = 3. The blocks will also be called triples. A configuration is said to be decomposable or disconnected if it is the union of two configurations on distinct point sets. We are primarily interested in indecomposable (connected) configurations, and so unless otherwise noted, this is assumed throughout the paper.
    [Show full text]
  • Pattern Avoidance and Fiber Bundle Structures on Schubert Varieties
    Thursday 2.10 Auditorium B Pattern Avoidance and Fiber Bundle Structures on Schubert Varieties Timothy Alland [email protected] SUNY Stony Brook (This talk is based on joint work with Edward Richmond.) MSC2000: 05E15, 14M15 Permutations are known to index type A Schubert varieties. A question one can ask regarding a specific Schubert variety is whether it is an iterated fiber bundle of Grass- mannian Schubert varieties, that is, if it has a complete parabolic bundle structure. We have found that a Schubert variety has a complete parabolic bundle structure if and only if its associated permutation avoids the patterns 3412, 52341, and 635241. We find this by first identifying when the standard projection from the Schubert variety in the complete flag variety to the Schubert variety in the Grassmannian is a fiber bundle using what we have called \split pattern avoidance". In this talk, I will demonstrate how we were able to move from a characterization of this projection in terms of the support and left descents of the permutation's parabolic decomposition to one that applies split pattern avoidance. I will also give a flavor of the proof of how the three patterns mentioned above determine whether a Schubert variety has a complete parabolic bundle structure. Monday 3.55 Auditorium B A simple proof of Shamir's conjecture Peter Allen [email protected] LSE (This talk is based on joint work with Julia B¨ottcher, Ewan Davies, Matthew Jenssen, Yoshiharu Kohayakawa, Barnaby Roberts.) MSC2000: 05C80 It is well known (and easy to show) that the threshold for a perfect matching in the bino- log n mial random graph G(n; p) is p = Θ n , coinciding with the threshold for every vertex to be in an edge (and much more is known).
    [Show full text]
  • Masterarbeit
    Masterarbeit Solution Methods for the Social Golfer Problem Ausgef¨uhrt am Institut f¨ur Informationssysteme 184/2 Abteilung f¨ur Datenbanken und Artificial Intelligence der Technischen Universit¨at Wien unter der Anleitung von Priv.-Doz. Dr. Nysret Musliu durch Markus Triska Kochgasse 19/7, 1080 Wien Wien, am 20. M¨arz 2008 Abstract The social golfer problem (SGP) is a combinatorial optimisation problem. The task is to schedule g ×p golfers in g groups of p players for w weeks such that no two golfers play in the same group more than once. An instance of the SGP is denoted by the triple g−p−w. The original problem asks for the maximal w such that the instance 8−4−w can be solved. In addition to being an interesting puzzle and hard benchmark problem, the SGP and closely related problems arise in many practical applications such as encoding, encryption and covering tasks. In this thesis, we present and improve upon existing approaches towards solving SGP instances. We prove that the completion problem correspond- ing to the SGP is NP-complete. We correct several mistakes of an existing SAT encoding for the SGP, and propose a modification that yields consid- erably improved running times when solving SGP instances with common SAT solvers. We develop a new and freely available finite domain constraint solver, which lets us experiment with an existing constraint-based formula- tion of the SGP. We use our solver to solve the original problem for 9 weeks, thus matching the best current results of commercial constraint solvers for this instance.
    [Show full text]
  • N3) with No Hamiltonian Circuit
    3-connected configurations (n3) with no Hamiltonian circuit Branko Grünbaum Department of Mathematics University of Washington Seattle, WA 98195, USA [email protected] Abstract. For more than a century there have been examples of (n3) configurations without a Hamiltonian circuit. However, all these examples were only 2-connected. It has been believed that all geometric 3-connected configura- tions (n3) admit Hamiltonian circuits. We present a 3-connected configuration (253) of points and lines in the Euclidean plane which has no Hamiltonian cir- cuit. 1. Introduction. A combinatorial configuration (n3) is a collection of n distinct symbols, which we call "points", together with n (unordered) triplets of "points". Each triplet is called a "line", and we shall assume through- out that each "point" appears in precisely three "lines", and that each pair of "points" appears in at most one "line". We shall also say that a "line" and each of its three "points" are mutually incident. "Points" and "lines" are collectively known as elements of the configuration. A configuration is connected if any two of its elements are the end terms of a finite chain, any two adjacent elements in which are mutually incident. A configuration is k-connected if it contains at least k+1 elements and it remains connected even if the deletion of k–1 or fewer of its elements cannot disconnect it. A combinatorial configuration C is geometrically realizable if there exists a mapping of the elements of C into the Euclidean plane such that each "point" is mapped to a point, each "line" is mapped to a (straight) line, and two incident elements of C are mapped to a point and a line that contains the point.
    [Show full text]
  • On Some Problems in Combinatorics, Graph Theory and Finite Geometries
    On some problems in combinatorics, graph theory and finite geometries Felix Lazebnik University of Delaware, USA August 8, 2017 1. Maximum number of λ-colorings of (v; e)-graphs 2. Covering finite vector space by hyperplanes 3. Figures in finite projective planes 4. Hamiltonian cycles and weak pancyclicity My plan for today: My plan for today: 1. Maximum number of λ-colorings of (v; e)-graphs 2. Covering finite vector space by hyperplanes 3. Figures in finite projective planes 4. Hamiltonian cycles and weak pancyclicity Problem Let v; e; λ be positive integers. What is the maximum number f (v; e; λ) of proper vertex colorings in (at most) λ colors a graph with v vertices and e edges can have? On which graphs is this maximum attained? The question can be rephrases as the question on maximizing χ(G; λ) over all graphs with v vertices and e edges. This problem was stated independently by Wilf (82) and Linial (86), and is still largely unsolved. 1. Maximum number of λ-colorings of (v; e)-graphs. The question can be rephrases as the question on maximizing χ(G; λ) over all graphs with v vertices and e edges. This problem was stated independently by Wilf (82) and Linial (86), and is still largely unsolved. 1. Maximum number of λ-colorings of (v; e)-graphs. Problem Let v; e; λ be positive integers. What is the maximum number f (v; e; λ) of proper vertex colorings in (at most) λ colors a graph with v vertices and e edges can have? On which graphs is this maximum attained? 1.
    [Show full text]