The following pages link to William G. Brown (Q590664):
Displaying 50 items.
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298) (← links)
- On multiplicity of triangles (Q308327) (← links)
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Tree-minimal graphs are almost regular (Q353399) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- A construction of imprimitive symmetric graphs which are not multicovers of their quotients (Q409392) (← links)
- On automorphisms of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\) (Q416854) (← links)
- On automorphisms of a distance-regular graph with intersection array \(\{42, 39, 1; 1, 3, 42\}\) (Q416874) (← links)
- A new combinatorial interpretation of a \(q\)-analogue of the Lah numbers (Q433477) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- The structure of alternative tableaux (Q533344) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- (Q587168) (redirect page) (← links)
- A short proof for the number of permutations containing pattern 321 exactly once (Q640473) (← links)
- On the limit of large girth graph sequences (Q653833) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- Bijective enumeration of some colored permutations given by the product of two long cycles (Q658051) (← links)
- The cardinality of the collection of maximum independent sets of a functional graph (Q678609) (← links)
- (Q789406) (redirect page) (← links)
- An extremal problem on v-partite graphs (Q789407) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- A new extremal property of Steiner triple-systems (Q801918) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Erdős-Ko-Rado theorems for permutations and set partitions (Q941314) (← links)
- Multivariate Fuss-Catalan numbers (Q942097) (← links)
- A Ramsey theorem for structures with both relations and functions (Q986108) (← links)
- Equipartite graphs (Q1001434) (← links)
- Intervals in Catalan lattices and realizers of triangulations (Q1003621) (← links)
- On Tutte polynomial uniqueness of twisted wheels (Q1011729) (← links)
- Nowhere-zero 4-flow in almost Petersen-minor free graphs (Q1011772) (← links)
- Edge-connectivity and edge-disjoint spanning trees (Q1011773) (← links)
- Graphs in cultures: a study in ethnomathematics (Q1106211) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true (Q1128134) (← links)
- Beyond the Erdős-Ko-Rado theorem (Q1174149) (← links)
- The classification of distance-transitive graphs of type \(q.K_{q,q}\) (Q1174156) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Binary invariants and orientations of graphs (Q1197033) (← links)
- Examples of products giving large graphs with given degree and diameter (Q1199421) (← links)
- On existence of sets of distinct representatives for families of subsets of a multiset (Q1203464) (← links)
- The harmonic logarithms and the binomial formula (Q1207774) (← links)
- Phylogeny numbers (Q1270783) (← links)
- Some combinatorial conjectures regarding the classical Chu- Vandermonde formula (Q1271873) (← links)
- A criterion for unimodality (Q1277786) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- Domination number of the cross product of paths (Q1293195) (← links)
- Two path extremal graphs and an application to a Ramsey-type problem (Q1297399) (← links)
- Graphs of diameter two with no 4-circuits (Q1301629) (← links)
