A combinatorial proof of a theorem of Freund
From MaRDI portal
Publication:2474499
DOI10.1016/J.JCTA.2007.04.003zbMATH Open1134.52304OpenAlexW2038073496MaRDI QIDQ2474499FDOQ2474499
Authors: Frédéric Meunier
Publication date: 6 March 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.04.003
Recommendations
- A combinatorial proof of Frobenius theorem
- scientific article; zbMATH DE number 749930
- A combinatorical proof of Kneser's conjecture
- A combinatorial proof of a theorem of Katsuura
- A combinatorial proof of a result of Gessel and Greene
- A combinatorial proof of Rohlin theorem
- A combinatorial proof of Louck's conjecture
- scientific article; zbMATH DE number 3995753
- A combinatorial analog of a theorem of F.J. Dyson
- A combinatorial converse to the Perron-Frobenius theorem
Cites Work
Cited In (12)
- A Combinatorial Proof for Stockhausen's Problem
- A combination theorem for \(PD(n)\)-pairs
- Many triangulated spheres
- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
- On a combinatorial theorem of Curtis Greene
- A combinatorial proof of the skew K-saturation theorem
- A proof of the equivalence of Tutte's theorem and Tutte-Berge's formula
- Combinatorial proof of the minimal excludant theorem
- A combinatorical proof of Kneser's conjecture
- A theorem on Molien type in combinatorics
- A combinatorial proof of an infinite version of the Hales-Jewett theorem
- Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
This page was built for publication: A combinatorial proof of a theorem of Freund
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474499)