Results 161 to 170 of about 14,016 (208)
Some of the next articles are maybe not open access.
Archiv der Mathematik, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Shyh-Nan, Shih, Mau-Hsiang
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Shyh-Nan, Shih, Mau-Hsiang
openaire +2 more sources
Combinatorics, Probability and Computing, 2008
Semple and Welsh [5] introduced the concept of correlated matroids, which relate to conjectures by Grimmett and Winkler [2], and Pemantle [4], respectively, that the uniformly random forest and the uniformly random connected subgraph of a finite graph have the edge-negative-association property. In this paper, we extend results of Semple and Welsh, and
openaire +2 more sources
Semple and Welsh [5] introduced the concept of correlated matroids, which relate to conjectures by Grimmett and Winkler [2], and Pemantle [4], respectively, that the uniformly random forest and the uniformly random connected subgraph of a finite graph have the edge-negative-association property. In this paper, we extend results of Semple and Welsh, and
openaire +2 more sources
Annals of Combinatorics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2003
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source
Discrete Mathematics and Applications, 2005
The object of study is an ordered set with some closure operator and a family of sets where some form of the axiom of closure is fulfilled.
openaire +2 more sources
The object of study is an ordered set with some closure operator and a family of sets where some form of the axiom of closure is fulfilled.
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1991
Summary: This paper begins with a short discussion of the general principles of Rigidity Theory. The main interest is the combinatorial part of this subject: generic rigidity. While generic rigidity has several combinatorial characterizations in dimensions one and two, these characterizations have not been able to be extended to characterizations of ...
openaire +1 more source
Summary: This paper begins with a short discussion of the general principles of Rigidity Theory. The main interest is the combinatorial part of this subject: generic rigidity. While generic rigidity has several combinatorial characterizations in dimensions one and two, these characterizations have not been able to be extended to characterizations of ...
openaire +1 more source
2001
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources
Journal of Mathematical Sciences, 2002
This review is devoted to the description of the main results of the theory of matroids. Translated from Russian and likely to have been written in the mid 1990s, the review begins with equivalent axiomatizations of matroids (including a table relating these axiomatizations), examples of matroids, and matroid constructions.
openaire +2 more sources
This review is devoted to the description of the main results of the theory of matroids. Translated from Russian and likely to have been written in the mid 1990s, the review begins with equivalent axiomatizations of matroids (including a table relating these axiomatizations), examples of matroids, and matroid constructions.
openaire +2 more sources
Equicardinal Matroids And Matroid Designs.
1970PhD ; Mathematics ; University of Michigan, Horace H. Rackham School of Graduate Studies ; http://deepblue.lib.umich.edu/bitstream/2027.42/186559/2/7115351 ...
openaire +2 more sources
1997
Abstract A matroid consists of a collection of subsets of a finite set which, loosely speaking, behave like the edge sets of cycles in a graph. Matroids also arise naturally from matrices and projective geometries. This chapter provides some examples, mainly in the context of connectivity, of how the interplay between graphs and matroids
openaire +1 more source
Abstract A matroid consists of a collection of subsets of a finite set which, loosely speaking, behave like the edge sets of cycles in a graph. Matroids also arise naturally from matrices and projective geometries. This chapter provides some examples, mainly in the context of connectivity, of how the interplay between graphs and matroids
openaire +1 more source