Peter Nelson

Zach Walsh

SIAM J. Discret. Math., September, 2022

The Structure of $I_4$-Free and Triangle-Free Binary Matroids.

[BibT_eX]

[DOI]

Kazuhiro Nomoto

SIAM J. Discret. Math., 2022

Bounding χ by a fraction of Δ for graphs without large cliques.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Enumeration of extensions of the cycle matroid of a complete graph.

[BibT_eX]

[DOI]

Shayla Redlin

Jorn G. van der Pol

Adv. Appl. Math., 2022

2021

The structure of claw-free binary matroids.

[BibT_eX]

[DOI]

Kazuhiro Nomoto

J. Comb. Theory B, 2021

The Smallest Matroids with no Large Independent Flat.

[BibT_eX]

[DOI]

Sergey Norin

Electron. J. Comb., 2021

2020

A Ramsey Theorem for Biased Graphs.

[BibT_eX]

[DOI]

Sophia Park

SIAM J. Discret. Math., 2020

The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids.

[BibT_eX]

[DOI]

Tony Huynh

SIAM J. Discret. Math., 2020

Stability and exact Turán numbers for matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

2019

On the Number of Biased Graphs.

[BibT_eX]

[DOI]

Jorn G. van der Pol

SIAM J. Discret. Math., 2019

2018

Doubly Exponentially Many Ingleton Matroids.

[BibT_eX]

[DOI]

Jorn G. van der Pol

SIAM J. Discret. Math., 2018

Matroids with no U2, n-minor and many hyperplanes.

[BibT_eX]

[DOI]

Adam Brown

Adv. Appl. Math., 2018

2017

On the Probability that a Random Subgraph Contains a Circuit.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

The structure of matroids with a spanning clique or projective geometry.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Odd circuits in dense binary matroids.

[BibT_eX]

[DOI]

Comb., 2017

2016

The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

The critical number of dense triangle-free binary matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

2015

On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Matroids Representable Over Fields With a Common Subfield.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Matroids Denser than a Projective Geometry.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Projective geometries in exponentially dense matroids. II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Matroids denser than a clique.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Projective geometries in exponentially dense matroids. I.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

A density Hales-Jewett theorem for matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

The number of lines in a matroid with no U2, n-minor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

The maximum-likelihood decoding threshold for graphic codes.

[BibT_eX]

[DOI]

CoRR, 2015

An analogue of the Erdős-Stone theorem for finite geometries.

[BibT_eX]

[DOI]

Comb., 2015

From dusk till dawn: Localisation at night using artificial light sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Building, Curating, and Querying Large-Scale Data Repositories for Field Robotics Applications.

[BibT_eX]

[DOI]

Chris Linegar

Paul Newman

Proceedings of the Field and Service Robotics, 2015

2014

The number of rank-k flats in a matroid with no U2, n-minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

What Is Sound?

[BibT_eX]

[DOI]

Proceedings of the Music Technology meets Philosophy, 2014

2013

Growth rate functions of dense classes of representable matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

On minor-closed classes of matroids with exponential growth rate.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

2010

The number of points in a matroid with no n-point line as a minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

2008

Sequential Automatic Algebras.

[BibT_eX]

[DOI]

Michael Brough

Bakhadyr Khoussainov