1![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 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](https://www.pdfsearch.io/img/93a8599664e019fcdfbc931b41db220f.jpg) | Add to Reading ListSource URL: page.math.tu-berlin.deLanguage: English |
---|
2![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 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](https://www.pdfsearch.io/img/b8d58f0d3938442b168cf18ec9ebcf74.jpg) | Add to Reading ListSource URL: staff.ustc.edu.cnLanguage: English - Date: 2015-09-23 05:24:08
|
---|
3![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 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](https://www.pdfsearch.io/img/02f130a6172208fc5aead29d957773b7.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2008-10-28 21:30:22
|
---|
4![Public Lecture, IPM-Isfahan Professor Edwin van Dam Tilburg University, The Netherlands Titel: Public Lecture, IPM-Isfahan Professor Edwin van Dam Tilburg University, The Netherlands Titel:](https://www.pdfsearch.io/img/37cc4a0030ca88185e9db0d6721279dc.jpg) | Add to Reading ListSource URL: math.ipm.ac.irLanguage: English - Date: 2015-04-26 07:32:42
|
---|
5![´ 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 ´ 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](https://www.pdfsearch.io/img/fe5e046262a6e4a35ddb37fd153443e5.jpg) | Add to Reading ListSource URL: www.math.uni-augsburg.deLanguage: English - Date: 2013-12-05 22:02:12
|
---|
6![Edge-superconnectivity of semiregular cages with odd girth Camino Balbuena and Juli´ an Salas Universitat Polit`cnica de Catalunya Barcelona Edge-superconnectivity of semiregular cages with odd girth Camino Balbuena and Juli´ an Salas Universitat Polit`cnica de Catalunya Barcelona](https://www.pdfsearch.io/img/c4623a7664cd9f9d8ec3ff5a5a34ec97.jpg) | Add to Reading ListSource URL: upcommons.upc.eduLanguage: English - Date: 2012-06-22 07:48:02
|
---|
7![´ 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 ´ 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](https://www.pdfsearch.io/img/97b2dbf586fad316697c08d778b2c8dd.jpg) | Add to Reading ListSource URL: www.math.uni-augsburg.deLanguage: English - Date: 2013-12-05 22:02:12
|
---|
8![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] 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]](https://www.pdfsearch.io/img/fbc2581785113a6b29118c7a74daae0d.jpg) | Add to Reading ListSource URL: integer.tepper.cmu.eduLanguage: English - Date: 2005-08-26 10:30:44
|
---|
9![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 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](https://www.pdfsearch.io/img/2d3ce6d499279704c3ca3eaebf9ba333.jpg) | Add to Reading ListSource URL: mathbits.comLanguage: English - Date: 2013-02-15 05:35:46
|
---|
10![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 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](https://www.pdfsearch.io/img/3534b638715299b3620202c425717f77.jpg) | Add to Reading ListSource URL: www.di-mgt.com.au- Date: 2003-09-23 21:29:20
|
---|