Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Source URL: page.math.tu-berlin.de

• Graph theory
• Kneser graph
• Petersen graph
• Odd graph
• Hamiltonian path
• Graph
• Cycle
• Planar graphs
• Desargues graph
• Polyhedral graph

Cycles with consecutive odd lengths Jie Ma∗ Abstract In this paper we prove that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree a

Source URL: staff.ustc.edu.cn

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Note on the pair-crossing number and the odd-crossing number G´eza T´oth∗ R´enyi Institute, Hungarian Academy of Sciences, Budapest

Source URL: cccg.ca

• Amplifiers
• Hoffmann-La Roche
• Molecular biology
• Crossing number
• Graph
• Graph theory
• Mathematics
• Polymerase chain reaction

Public Lecture, IPM-Isfahan Professor Edwin van Dam Tilburg University, The Netherlands Titel:

Source URL: math.ipm.ac.ir

• Adjacency matrix
• Odd graph
• Hamming graph
• Johnson graph
• Two-graph
• Hypercube graph
• Graph theory
• Algebraic graph theory
• Distance-regular graph

´ DUALITY IN P.A. SMITH THEORY POINCARE CHRISTOPHER ALLDAY, BERNHARD HANKE, AND VOLKER PUPPE Abstract. Let G = S 1 , G = Z/p or more generally G be a finite pgroup, where p is an odd prime. If G acts on a space whose co

Source URL: www.math.uni-augsburg.de

• Algebraic topology
• Betti number
• Topological graph theory
• Lefschetz fixed-point theorem
• Duality
• Inner product space
• Representation theory of finite groups
• Heat equation
• Mathematics
• Abstract algebra
• Algebra

Edge-superconnectivity of semiregular cages with odd girth Camino Balbuena and Juli´ an Salas Universitat Polit`cnica de Catalunya Barcelona

Source URL: upcommons.upc.edu

• Degree
• Connectivity
• K-edge-connected graph
• Graph theory
• Mathematics
• Theoretical computer science

´ DUALITY IN P.A. SMITH THEORY POINCARE CHRISTOPHER ALLDAY, BERNHARD HANKE, AND VOLKER PUPPE Abstract. Let G = S 1 , G = Z/p or more generally G be a finite pgroup, where p is an odd prime. If G acts on a space whose co

Source URL: www.math.uni-augsburg.de

• Algebraic topology
• Betti number
• Topological graph theory
• Lefschetz fixed-point theorem
• Duality
• Inner product space
• Representation theory of finite groups
• Heat equation
• Mathematics
• Abstract algebra
• Algebra

Odd Hole Recognition in Graphs of Bounded Clique Size Michele Conforti Dipartimento di Matematica Pura ed Applicata Universit`a di Padova Via Belzoni 7, 35131 Padova, Italy [removed]

Source URL: integer.tepper.cmu.edu

• Clique
• Neighbourhood
• Rado graph
• Graph operations
• Graph theory
• Graph
• Vertex

Study of Functions (functions, domain, range, continuous, odd/even, inverse, algebra, composition) Directions: Answer the following questions pertaining to the study of functions. You may use your graphing calculator to

Source URL: mathbits.com

• Inverse function
• Graph of a function
• Function
• Continuous function
• Surjective function
• Derivative
• Mathematical analysis
• Mathematics
• Functions and mappings

Finding an Euler Path To find an Euler path for the graph below: Vertices B and C are the only two of odd degree; therefore an Euler path must start and end at these vertices. Add a dummy edge BC to join these two vertic

Source URL: www.di-mgt.com.au