Projective Planes, Coverings and a Network Problem

Authors:
Jürgen Bierbrauer;Stefano Marcugini;Fernanda Pambianco
Affiliations:
Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA;Dipartimento di Matematica, e Informatica Università degli Studi di Perugia, Perugia, Italy;Dipartimento di Matematica, e Informatica Università degli Studi di Perugia, Perugia, Italy
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 4
Cited 0

Covering the complete graph by partitions

Discrete Mathematics
Finite geometries

Finite geometries
Combinatorial design of congestion-free networks

IEEE/ACM Transactions on Networking (TON)
Projective planes and congestion-free networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A problem concerning packet switched networks leads to a natural combinatorial design problem, whose solution involves (k, n)-arcs in projective planes, 3-dimensional linear codes, the theory of fractional matchings and designs which approximate projective planes.