Stabilizer theorems for even cycle matroids
Journal of Combinatorial Theory, Series B, ISSN: 0095-8956, Vol: 118, Page: 44-75
2016
- 5Citations
- 4Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Two long standing open questions regarding even cycle matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cycle matroids can have an arbitrary number of pairwise inequivalent representations (for a natural definition of equivalence). We show that we can bound the number of inequivalent representations of an even cycle matroid M (under some mild connectivity assumptions) if M contains any fixed size minor that is not a projection of a graphic matroid. For instance, any connected even cycle matroid which contains R10 as a minor has at most 6 inequivalent representations.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0095895616000083; http://dx.doi.org/10.1016/j.jctb.2016.01.006; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84961210194&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0095895616000083; https://dul.usage.elsevier.com/doi/; https://api.elsevier.com/content/article/PII:S0095895616000083?httpAccept=text/plain; https://api.elsevier.com/content/article/PII:S0095895616000083?httpAccept=text/xml
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know