ScholarLens Back to search
2007•European Journal of CombinatoricsOpen access

Perfect packings with complete graphs minus an edge

Oliver Cooley, Daniela Kühn, Deryk Osthus

Open full text 13 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Combinatorics, Mathematics, Conjecture, Disjoint sets, Graph, Integer (computer science), Degree (music), Order (exchange)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Perfect packings with complete graphs minus an edge — Research Paper | ScholarLens