The matroid of a graphing

DOI10.1016/J.JCTB.2024.08.001MaRDI QIDQ6615766

László Miklós Lovász

Publication date: 8 October 2024

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

zbMATH Keywords

matroidgraph limitsgraphingsubmodular setfunction

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• First order convergence of matroids
• Axioms for infinite matroids
• Non-additive measure and integral
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Recurrence of distributional limits of finite planar graphs
• Theory of capacities
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
• Parameter testing in bounded degree graphs of subexponential growth
• Continuous partition lattice
• On Realization of Bjorner's 'Continuous Partition Latice' by Measurable Partitions

This page was built for publication: The matroid of a graphing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615766)