Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Lovász, László, Recski, András
Similarity:
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Richter-Gebert, Jürgen (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Fedor Petrov (2014)
Acta Arithmetica
Similarity:
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.
Adam H. Piwocki (2007)
Colloquium Mathematicae
Similarity:
We study the determinant of pairs of rotants of Anstee, Przytycki and Rolfsen. We consider various notions of rotant orientations.
Kiran Dalvi, Y.M. Borse, M.M. Shikare (2011)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K₄).