A Simple Proof of the Perfect Matching Theorem

Ján Plesník

Matematický časopis (1975)

  • Volume: 25, Issue: 2, page 185-188
  • ISSN: 0139-9918

How to cite

top

Plesník, Ján. "A Simple Proof of the Perfect Matching Theorem." Matematický časopis 25.2 (1975): 185-188. <http://eudml.org/doc/30105>.

@article{Plesník1975,
author = {Plesník, Ján},
journal = {Matematický časopis},
keywords = {1-factor in a graph; induction; König-Hall theorem; bipartite graph},
language = {eng},
number = {2},
pages = {185-188},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {A Simple Proof of the Perfect Matching Theorem},
url = {http://eudml.org/doc/30105},
volume = {25},
year = {1975},
}

TY - JOUR
AU - Plesník, Ján
TI - A Simple Proof of the Perfect Matching Theorem
JO - Matematický časopis
PY - 1975
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 25
IS - 2
SP - 185
EP - 188
LA - eng
KW - 1-factor in a graph; induction; König-Hall theorem; bipartite graph
UR - http://eudml.org/doc/30105
ER -

References

top
  1. ANDERSON I., Perfect matchings of a graph, J. Comb. Theory (B) 10, 1971, 183-186. (1971) Zbl0172.48904MR0276105
  2. BALINSKI M. L., On perfect matchings, SIAM Rev. 12, 1970, 570-572. (1970) Zbl0227.05117MR0285419
  3. BELCK H. B., Reguläre Faktoren von Graphen, J. Reine Angew. Math. 188, 1950, 228-252. (1950) Zbl0040.26001MR0040660
  4. BERGE, C, Sur le couplage maximum d'un graphe, C. R. Acad. Sciences 247, 1958, 258-259. (1958) Zbl0086.16301MR0100850
  5. GALLAI T., On factorisation of graphs, Acta Math. Acad. Sci. Hung. 1, 1950, 133-153. (1950) Zbl0040.25901MR0039980
  6. GALLAI T., Neuer Beweis eines Tutte-schen Satzes, Magyar Tud. Akad. Matem. Kut. Int. Közl. 8, 1963, 135-139. (1963) MR0166777
  7. GALLAI T., Maximale Systeme unabhängiger Kanten, Magyar Tud. Akad. Matem. Kut. Int. Közl. 9, 1964, 401-413. (1964) Zbl0135.42001MR0190029
  8. HALL P., On representatives of subsets, J. London Math. Soc. 10, 1935, 26-30. (1935) Zbl0010.34503
  9. HALTON J., A combinatorial proof of a theorem of Tutte, Proc. Cambridge Phil. Soc. 62, 1966, 683-684. (1966) Zbl0149.21404MR0201341
  10. HARARY F., Graph theory, Addison-Wesley. Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
  11. JUNG H. A., Maximal- Γ -prime Graphen, Math. Ann. 153, 1964, 210-226. (1964) Zbl0115.41004MR0161329
  12. KÖNIG D., Graphen und Matritzen, Mat. Fiz. Lapok 38, 1931, 116-119. (1931) 
  13. LOVÁSZ L., Subgraphs with prescribed valencies, J. Comb. Theory 8, 1970, 391-416. (1970) Zbl0198.29201MR0265201
  14. LOVÁSZ L., Generalized factors of graphs, Comb. Theory Appl. Colloquia Math. Soc. János Bolyai 4, 1970, 773-781. (1970) Zbl0209.55301MR0300933
  15. MAUNSELL F. G., A note on Tutte's paper, J. London Math. Soc. 27, 1952, 127-128. (1952) Zbl0046.16901MR0045370
  16. ORE O., Graphs and matching theorems, Duke Math. J. 22, 1955, 625-639. (1955) Zbl0068.16301MR0073171
  17. ORE O., Graphs and subgraphs, Trans. Amer. Math. Soc. 84, 1957, 109-136 and 93, 1959, 185-204. (1957) Zbl0077.17001MR0083725
  18. TUTTE W. T., The factorization of linear graphs, J. London Math. Soc. 22, 1947, 107-111 (1947) Zbl0029.23301MR0023048
  19. TUTTE W. T., The factors of graphs, Canad. J. Math. 4, 1952, 314-328. (1952) Zbl0049.24202MR0048775
  20. TUTTE W. T., A short proof of the factor theorem for finite graphs, Canad. J. Math. 6, 1954, 347-352. (1954) Zbl0055.17102MR0063008
  21. WAGNER K., Faktorklassen in Graphen, Math. Ann. 141, 1960, 49-67. (1960) Zbl0091.37603MR0115931

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.