On bipartite restrictions of binary matroids

DOI10.1016/J.EJC.2011.04.005zbMATH Open1229.05081OpenAlexW2081429117MaRDI QIDQ648977FDOQ648977

Authors: James Oxley 

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.04.005

Recommendations

• Matroids with every two elements in a 4-circuit.
• New characterizations of Eulerian and bipartite binary matroids
• The binary matroids whose only odd circuits are triangles
• A proof of McKee's Eulerian-bipartite characterization
• An Erdős-Gallai theorem for matroids

zbMATH Keywords

loopless binary matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Euler and bipartite matroids
• Some Extremal Properties of Bipartite Subgraphs
• On some extremal problems in graph theory
• Nowhere-zero 6-flows
• Title not available (Why is that?)
• Shortest coverings of graphs with cycles
• The size of the largest bipartite subgraphs
• Title not available (Why is that?)
• A note on the critical problem for matroids

Cited In (2)

• The biased graphs whose matroids are binary
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids

This page was built for publication: On bipartite restrictions of binary matroids

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