The following pages link to Michael W. Newman (Q1010644):
Displaying 27 items.
- (Q289991) (redirect page) (← links)
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations (Q289992) (← links)
- Digraphs are 2-weight choosable (Q625384) (← links)
- Graph-intersecting set systems and LYM inequalities (Q729770) (← links)
- (Q858142) (redirect page) (← links)
- Independent sets in association schemes (Q858143) (← links)
- Eigenvalue bounds for independent sets (Q933677) (← links)
- On the quantum chromatic number of a graph (Q1010645) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- On excluded minors for real-representability (Q1026009) (← links)
- Binary covering arrays on tournaments (Q1648654) (← links)
- On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
- Fractal classes of matroids (Q2020029) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- On the asymptotic proportion of connected matroids (Q2275477) (← links)
- Bounds on polygons of higher rank numerical ranges (Q2341827) (← links)
- Obstacles to decomposition theorems for sixth-root-of-unity matroids (Q2343465) (← links)
- Extending factorizations of complete uniform hypergraphs (Q2416440) (← links)
- A note on packing spanning trees in graphs and bases in matroids (Q2876023) (← links)
- IS THE MISSING AXIOM OF MATROID THEORY LOST FOREVER? (Q2939482) (← links)
- Coloring an Orthogonality Graph (Q3629469) (← links)
- Yes, the “missing axiom” of matroid theory is lost forever (Q4642529) (← links)
- Defining Bicircular Matroids in Monadic Logic (Q5066210) (← links)
- (Q5403011) (← links)
- The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
- Yes, the "missing axiom" of matroid theory is lost forever (Q6257679) (← links)
- Defining bicircular matroids in monadic logic (Q6340366) (← links)
