147 research outputs found
Properties of Steiner triple systems of order 21
Properties of the 62,336,617 Steiner triple systems of order 21 with a
non-trivial automorphism group are examined. In particular, there are 28 which
have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20
that avoid the mitre, 21 that avoid the crown, one that avoids the hexagon and
two that avoid the prism. All systems contain the grid. None have a block
intersection graph that is 3-existentially closed.Comment: 12 page
Recommended from our members
Configurations and colouring problems in block designs
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an equitable 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(v) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(v) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3-1-isomorphic. We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(v)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and v = 100 (the design of the century)
Existential Closure in Line Graphs
A graph is -existentially closed if, for all disjoint sets of vertices
and with , there is a vertex not in adjacent
to each vertex of and to no vertex of .
In this paper, we investigate -existentially closed line graphs. In
particular, we present necessary conditions for the existence of such graphs as
well as constructions for finding infinite families of such graphs. We also
prove that there are exactly two -existentially closed planar line graphs.
We then consider the existential closure of the line graphs of hypergraphs and
present constructions for -existentially closed line graphs of hypergraphs.Comment: 13 pages, 2 figure
The pragmatic proof: hypermedia API composition and execution
Machine clients are increasingly making use of the Web to perform tasks. While Web services traditionally mimic remote procedure calling interfaces, a new generation of so-called hypermedia APIs works through hyperlinks and forms, in a way similar to how people browse the Web. This means that existing composition techniques, which determine a procedural plan upfront, are not sufficient to consume hypermedia APIs, which need to be navigated at runtime. Clients instead need a more dynamic plan that allows them to follow hyperlinks and use forms with a preset goal. Therefore, in this paper, we show how compositions of hypermedia APIs can be created by generic Semantic Web reasoners. This is achieved through the generation of a proof based on semantic descriptions of the APIs' functionality. To pragmatically verify the applicability of compositions, we introduce the notion of pre-execution and post-execution proofs. The runtime interaction between a client and a server is guided by proofs but driven by hypermedia, allowing the client to react to the application's actual state indicated by the server's response. We describe how to generate compositions from descriptions, discuss a computer-assisted process to generate descriptions, and verify reasoner performance on various composition tasks using a benchmark suite. The experimental results lead to the conclusion that proof-based consumption of hypermedia APIs is a feasible strategy at Web scale.Peer ReviewedPostprint (author's final draft
Hypergraphs, existential closure, and related problems
In this thesis, we present results from multiple projects with the theme of extending results
from graphs to hypergraphs. We first discuss the existential closure property in graphs, a
property that is known to hold for most graphs but in practice, examples of these graphs
are hard to find. Specifically, we focus on finding necessary conditions for the existence of
existentially closed line graphs and line graphs of hypergraphs. We then present constructions
for generating infinite families of existentially closed line graphs. Interestingly, when
restricting ourselves to existentially closed planar line graphs, we find that there are only
finitely many such graphs.
Next, we consider the notion of an existentially closed hypergraph, a novel concept that
retains many of the necessary properties of an existentially closed graph. Again, we present
constructions for generating infinitely many existentially closed hypergraphs. These constructions
use combinatorial designs as the key ingredients, adding to the expansive list of
applications of combinatorial designs.
Finally, we extend a classical result of Mader concerning the edge-connectivity of vertextransitive
graphs to linear uniform vertex-transitive hypergraphs. Additionally, we show
that if either the linear or uniform properties are absent, then we can generate infinite
families of vertex-transitive hypergraphs that do not satisfy the conclusion of the generalised
theorem
- …