Le Matematiche  

Mario Gionfriddo

This issue is dedicated to the Second Catania Combinatorial Conference.

Adriano Barlotti

See directly the article.

Claude Berge

Visizing's Theorem states that for a single graph G, the chromatic index q(G) is equal to the maximum degree ?(G) or to ?(G)+1. To extend this theorem to some classes of hypergraphs, we suggest two conjectures, non-comparable, but, in some sense, dual, wh... see more

Albrecht Beutelspracher

Linear spaces belong to the most fundamental geometric and combinatorial structures. In this paper I would like to give an onerview about the theory of embedding finite linear spaces in finite projective planes.

Charles J. Colbourn, Gordon F. Royle

The spectrum of possible numbers of repeated blocks in (?,4,2) designs is determined for all ??121.

Paul Erdös

I refer to a few of my papers which state unsolved problems.

Frank Harary

See directly the article.

Curt Lindner

See directly the article.

Chris A. Rodger

This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of Kn into copies of G, where G may be a cycle, a path, or just a small graph. Additional properties of such a decomposition are considered, such as nestings... see more

Barbara Rokowska

See directly the article.

Alexander Rosa

See directly the article.

Bhu Dev Sharma, Norris Sookoo

See directly the article.

Giuseppe Tallini

See directly the article.

Luc Teirlinck

We prove that a set of v-2 symmetric idempotent latin squares of order v, such that no two of them agree in a off-diagonal position, exists for all odd v>>0. We describe how the techniques used in the proof relate to techniques used in [17] to const... see more

Szolt Tuza

See directly the article.