Sciweavers

105 search results - page 2 / 21
» Euler's Partition Theorem
Sort
View
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 5 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
MLQ
1998
126views more  MLQ 1998»
13 years 5 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
BIRTHDAY
2009
Springer
14 years 8 days ago
On Path Partitions and Colourings in Digraphs
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
Irith Ben-Arroyo Hartman
APPML
2006
79views more  APPML 2006»
13 years 5 months ago
Example of supersonic solutions to a steady state Euler-Poisson system
We give an example of supersonic solutions to a one-dimensional steady state Euler-Poisson system arising in the modeling of plasmas and semiconductors. The existence of the supers...
Yue-Jun Peng, Ingrid Violet
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 5 months ago
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps
This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assi...
Jean-François Dufourd