2011•European Journal of CombinatoricsOpen access

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs

Louis Esperet, František Kardoš, Daniel Král͏̌

Open full text 7 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 7 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: Mathematics, Combinatorics, Bipartite graph, Strong perfect graph theorem, Cubic graph, Conjecture, Trivially perfect graph, Discrete mathematics

Back to paper search Browse research topics Original source

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs — Research Paper | ScholarLens