Treffer: Trees with maximum number of maximal matchings
Title:
Trees with maximum number of maximal matchings
Authors:
Source:
The Fourth Cracow Conference on Graph Theory Czorsztyn 2002Discrete mathematics. 307(11-12):1367-1377
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Arbre, Tree, Arbol, Borne inférieure, Lower bound, Cota inferior, Borne supérieure, Upper bound, Cota superior, Caractérisation, Characterization, Caracterización, Enumération, Enumeration, Enumeración, Forêt, Forests, Bosque, Maximum, Máximo, Vertex, Vértice, 05C05, Borne exponentielle, Concordance maximale, Characterization of structure, Forest, Maximal matching
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculty of Applied Mathematics, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Kraków, Poland
ISSN:
0012-365X
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.18660647
Database:
PASCAL Archive
Weitere Informationen
Forests on n vertices with maximum number of maximal matchings are called extremal forests. All extremal forests, except 2K1, are trees. Extremal trees with small number n of vertices, n ≤ 19, are characterized; in particular, they are unique if n # 6. The exponential upper and lower bounds on the maximum number of maximal matchings among n-vertex trees have been found.