De grafos a emparelhamentos : uma possibilidade viável de encantar-se com a matemática

• Ano de defesa: 2014
• Autor(a) principal: Ferreira, Verônica Craveiro de Santana
• Orientador(a): Ramos, Zaqueu Alves
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Sergipe
• Programa de Pós-Graduação: Mestrado Profissional em Matemática
• País: Brasil
• Palavras-chave em Português: Matemática; Teoria dos grafos; Algoritmos; Matemática (estudo e ensino); Prática de ensino (matemática); Grafos; Grafos bipartidos; Emparelhamento
• Palavras-chave em Inglês: Graphs; Algorithms; Bipartite graphs; Matchings
• Área do conhecimento CNPq: CIENCIAS EXATAS E DA TERRA::MATEMATICA
• Link de acesso: https://ri.ufs.br/handle/riufs/6510

This thesis aims to show that the theory of graphs, especially matching, can be studied in high school and gradually as the implementation of this theory in the classroom can foster in students interest in mathematics. Thus, this paper aims to demystify the idea that mathematics content ends with high school approaching students the theories recently developed in academy. The graph theory is considered an e cient tool to solve problems in various areas. There are numerous situations that can be modeled by that enable develop a range of skills, so it becomes so appealing to anyone who comes into contact with it. For the development of this thesis began our study addressing basic concepts of graph theory useful for understanding this work then present some problems that can be worked in high school and nalized with a speci c topic of this theory, matchings, with many applications that can be modeled as contextualized and practical problems of everyday life.