On the nonreconstructibility of combinatorial geometries

DOI10.1016/0095-8956(75)90074-XzbMath0309.05019MaRDI QIDQ1218866

Tom Brylawski

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Reconstructing under group actions., Techniques in matroid reconstruction, Totally symmetric functions are reconstructible from identification minors, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, On an excluded-minor class of matroids, Combinatorial analysis. (Matrix problems, choice theory), Intersection Theory for Embeddings of Matroids into Uniform Geometries, A family of non-reconstructible hypergraphs

Cites Work

• A combinatorial perspective on the Radon convexity theorem
• A note on the line reconstruction problem
• Unnamed Item