• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 519
Next 10 →

Invitation to Fixed-Parameter Algorithms

by Rolf Niedermeier , 2002
"... ..."
Abstract - Cited by 446 (80 self) - Add to MetaCart
Abstract not found

Configurations in Steiner triple systems

by M. J. Grannell, T. S. Griggs , 1999
"... ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract not found

1 Mendelsohn Directed Triple Systems

by Mike Grannell, Terry S. Griggs, Kathleen A. S. Quinn
"... This is a preprint of an article accepted for publi-cation in Discrete Mathematics c © 1999 (copyright ..."
Abstract - Add to MetaCart
This is a preprint of an article accepted for publi-cation in Discrete Mathematics c © 1999 (copyright

The spectrum of rotational directed triple systems and rotational Mendelsohn triple systems

by Miwako Mishima
"... Necessary and sufficient conditions for the existence of k-rotational directed triple systems and k-rotational Mendelsohn triple systems are derived. 1. ..."
Abstract - Add to MetaCart
Necessary and sufficient conditions for the existence of k-rotational directed triple systems and k-rotational Mendelsohn triple systems are derived. 1.

Embedding partial Steiner triple systems

by L. D. Andersen, A. J. W. Hilton, E. Mendelsohn - Proc. London Math. Soc , 1980
"... We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple sys ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple

Independent sets in Steiner triple systems

by A. D. Forbes, M. J. Grannell, T. S. Griggs - Ars Comb
"... This is a preprint of an article accepted for publication in Ars Combinatoria c○2004 (copyright owner as specified in the journal). A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k ≤ ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This is a preprint of an article accepted for publication in Ars Combinatoria c○2004 (copyright owner as specified in the journal). A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k

Linearly derived Steiner triple systems

by E. F. Assmus, Jr. - Designs, Codes, and Cryptography (submitted
"... this paper. Any of the standard references on design theory and graph theory will contain the necessary background. Moreover, we define most notions as they are introduced. The only departure from the nomenclature of the vast existing literature on Steiner triple systems is that we use "order&q ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
this paper. Any of the standard references on design theory and graph theory will contain the necessary background. Moreover, we define most notions as they are introduced. The only departure from the nomenclature of the vast existing literature on Steiner triple systems is that we use "

On 2-ranks of Steiner triple systems

by Assmus Jr Submitted, E. F. Assmus - Electron. J. Combin., 2:Research Paper , 1995
"... Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code --- called the "carrier" --- which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number ..."
Abstract - Add to MetaCart
Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code --- called the "carrier" --- which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number

WEAK COLORINGS OF STEINER TRIPLE SYSTEMS

by Çiçek Güven, Çiçek Güven, Prof Haluk Oral, Asst Prof, Emine S. Yazıcı , 2007
"... and have found that it is complete and satisfactory in all respects, Committee Members: Date: and that any and all revisions required by the final examining committee have been made. ..."
Abstract - Add to MetaCart
and have found that it is complete and satisfactory in all respects, Committee Members: Date: and that any and all revisions required by the final examining committee have been made.

A CENSUS OF STEINER TRIPLE SYSTEMS AND SOME RELATED COMBINATORIAL OBJECTS

by Petteri Kaski, Abteknillinen Korkeakoulu, Universite De, Petteri Kaski, Tietotekniikan Osasto
"... ABSTRACT: A Steiner triple system of order v (STS(v)) is a set of triples, or blocks, constructed over a set of v points, such that every pair of distinct points occurs in a unique block. Previously, a complete classification of the STS(v) up to isomorphism was known only for v ≤ 15. In this work, w ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
ABSTRACT: A Steiner triple system of order v (STS(v)) is a set of triples, or blocks, constructed over a set of v points, such that every pair of distinct points occurs in a unique block. Previously, a complete classification of the STS(v) up to isomorphism was known only for v ≤ 15. In this work
Next 10 →
Results 1 - 10 of 519
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University