56 research outputs found
Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree
We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of the host graph for the existence of such rainbow spanning structures. The proof uses a probabilisitic argument combined with switching techniques
Hipergráfok = Hypergraphs
A projekt cĂ©lkitűzĂ©seit sikerĂĽlt megvalĂłsĂtani. A nĂ©gy Ă©v során több mint száz kiválĂł eredmĂ©ny szĂĽletett, amibĹ‘l eddig 84 dolgozat jelent meg a tĂ©ma legkiválĂłbb folyĂłirataiban, mint Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, stb. Számos rĂ©gĂłta fennállĂł sejtĂ©st bebizonyĂtottunk, egĂ©sz rĂ©gi nyitott problĂ©mát megoldottunk hipergráfokkal kapcsolatban illetve kapcsolĂłdĂł terĂĽleteken. A problĂ©mák nĂ©melyike sok Ă©ve, olykor több Ă©vtizede nyitott volt. Nem egy közvetlen kutatási eredmĂ©ny, de szintĂ©n bizonyos Ă©rtĂ©kmĂ©rĹ‘, hogy a rĂ©sztvevĹ‘k egyike a NorvĂ©g Királyi AkadĂ©mia tagja lett Ă©s elnyerte a Steele dĂjat. | We managed to reach the goals of the project. We achieved more than one hundred excellent results, 84 of them appeared already in the most prestigious journals of the subject, like Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory, Random Graphs and Structures, etc. We proved several long standing conjectures, solved quite old open problems in the area of hypergraphs and related subjects. Some of the problems were open for many years, sometimes for decades. It is not a direct research result but kind of an evaluation too that a member of the team became a member of the Norvegian Royal Academy and won Steele Prize
Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree
We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of the host graph for the existence of such rainbow spanning structures. The proof uses a probabilisitic argument combined with switching techniques.Postprint (updated version
- …