The following pages link to Jason I. Brown (Q343710):
Displaying 50 items.
- (Q234380) (redirect page) (← links)
- On the real roots of \(\sigma\)-polynomials (Q343712) (← links)
- Independence densities of hypergraphs (Q402469) (← links)
- The average reliability of a graph (Q406318) (← links)
- Independence and chromatic densities of graphs (Q446006) (← links)
- (Q489303) (redirect page) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- On the location of roots of independence polynomials (Q596652) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- On a sequence of sparse binomial-type polynomials (Q691817) (← links)
- On the roots of Wiener polynomials of graphs (Q724845) (← links)
- The well-covered dimension of random graphs (Q864120) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- Chip firing and all-terminal network reliability bounds (Q1040088) (← links)
- Monomial bases for broken circuit complexes (Q1041597) (← links)
- The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane (Q1044980) (← links)
- Self complementary topologies and preorders (Q1177704) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- A vertex critical graph without critical edges (Q1193438) (← links)
- A Ramsey type problem concerning vertex colourings (Q1262327) (← links)
- On the roots of chromatic polynomials (Q1272480) (← links)
- Subdivisions and chromatic roots (Q1306307) (← links)
- On the log concavity of reliability and matroidal sequences (Q1325759) (← links)
- Partial order complementation graphs (Q1344245) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- The independence fractal of a graph. (Q1405113) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- Chromatic polynomials and order ideals of monomials (Q1584366) (← links)
- On the unimodality of independence polynomials of very well-covered graphs (Q1699567) (← links)
- The shape of node reliability (Q1701111) (← links)
- On the stability of independence polynomials (Q1753011) (← links)
- Optimal graphs for independence and \(k\)-independence polynomials (Q1756111) (← links)
- Average independence polynomials (Q1767674) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← links)
- On the chromatic roots of generalized theta graphs (Q1850569) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Non-Stanley bounds for network reliability (Q1906250) (← links)
- The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) (Q1918536) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- A note on purely imaginary independence roots (Q2005699) (← links)
- On the roots of domination polynomials (Q2014706) (← links)
- On the roots of the node reliability polynomial (Q4639686) (← links)
- Nonexistence of optimal graphs for all terminal reliability (Q4639690) (← links)
- Inflection points of reliability polynomials are dense in [0,1] (Q4642412) (← links)
- Asymptotics of a sequence of sparse binomial-type polynomials (Q4648897) (← links)
- The strongly connected reliability of complete digraphs (Q4680417) (← links)
- On the imaginary parts of chromatic roots (Q5110657) (← links)
- Network transformations and bounding network reliability (Q5285474) (← links)
- On the Roots of Expected Independence Polynomials (Q5325944) (← links)
