Discrete Mathematics & Theoretical Computer Science (Jan 2013)

A bound on the number of perfect matchings in Klee-graphs

Marek Cygan,
Marcin Pilipczuk,
Riste Škrekovski

Affiliations

Marek Cygan: ORCiD; Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
Marcin Pilipczuk: Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
Riste Škrekovski: ORCiD; Faculty of Mathematics and Physics [Ljubljana]

DOI: https://doi.org/10.46298/dmtcs.633
Journal volume & issue: Vol. Vol. 15 no. 1, no. Combinatorics

Abstract

Combinatorics

[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal