Browsing by Advisor "Nešetřil, Jaroslav"
Now showing items 1-14 of 14
-
Asymptotical Structure of Combinatorial Objects
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2007)Date of defense: 2. 5. 2007 -
Combinatorial Games Theory
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2012)Date of defense: 2. 8. 2012Title: Combinatorial Games Theory Author: Tomáš Valla Department / Institute: IUUK MFF UK Supervisor: Prof. RNDr. Jaroslav Nešetřil, DrSc., IUUK MFF UK Abstract: In this thesis we study the complexity that appears when we ... -
Combinatorial Properties of Finite Models
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2010)Date of defense: 29. 7. 2010We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called ... -
Extension Properties of Graphs and Structures
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2017)Date of defense: 12. 9. 2017Extension Properties of Graphs and Structures Pavel Klavík The main motivation for graph drawing and geometric representations is finding ways to visualize graphs efficiently to make their structure as understandable as ... -
Extension property of structures
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2014)Date of defense: 1. 8. 2014This work analyses properties of relational structures that imply a high degree of symmetry. A structure is called homogeneous if every mapping from any finite substructure can be extended to a mapping over the whole ... -
Graph Algorithms
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2008)Date of defense: 29. 7. 2008 -
Homomorphisms and Structural Properties of Relational Systems
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2007)Date of defense: 31. 7. 2007 -
On XY Mappings
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2006)Date of defense: 17. 7. 2006 -
Ramsey Theory
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2008)Date of defense: 22. 1. 2008 -
Ramseyova teorie a kombinatorické hry
Defence status: RECOGNIZED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2010)Date of defense: 27. 1. 2010Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), parts of which (subgraphs, number subsets) are arbitrarily coloured. Often, the sufficient object size implies the existence ... -
Ramseyova teorie a kombinatorické hry
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2006)Date of defense: 22. 5. 2006Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), parts of which (subgraphs, number subsets) are arbitrarily coloured. Often, the sufficient object size implies the existence ... -
Representation of special classes of combinatorial objects
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2012)Date of defense: 18. 9. 2012V této práci se pokoušíme propojit poznatky ze dvou oblastí teorie grafů. Nejprve uvádíme základní pojmy týkající se homomorfismů grafů. Text směřuje k defi- nici nahrazovací operace užitím vhodného nahrazovacího grafu. ... -
Structural aspects of aesthetic visualinformation processing
Defence status: DEFENDED(Univerzita Karlova, Filozofická fakulta, 2022)Date of defense: 10. 5. 2022Univerzita Karlova Filozofická fakulta Katedra logiky Obor: Logika Strukturální aspekty zpracování vizuální informace s estetickou složkou Structural aspects of aesthetic visual information processing Abstract Mgr. Veronika ... -
Stuctural Aspects of Graph Homomorphisms
Defence status: DEFENDED(Univerzita Karlova, Matematicko-fyzikální fakulta, 2017)Date of defense: 6. 9. 2017This thesis is about graph-indexed random walks, Lipschitz mappings and graph homo- morphisms. It discusses connections between these notions, surveys the existing results, and shows new results. Graph homomorphism is an ...