John W. Moon

From MaRDI portal
Revision as of 10:00, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page John W. Moon to John W. Moon: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:656146

Available identifiers

zbMath Open moon.john-wWikidataQ102124040 ScholiaQ102124040MaRDI QIDQ656146

List of research outcomes

PublicationDate of PublicationType
On negative dependence inequalities and maximal scores in round-robin tournaments2022-04-22Paper
Walks and cycles on a digraph with application to population dynamics2014-06-03Paper
Win-loss sequences for generalized roundrobin tournaments2012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q35951152007-08-10Paper
https://portal.mardi4nfdi.de/entity/Q34230642007-02-20Paper
Weakening arcs in tournaments2004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45521812002-08-29Paper
On centroid branches of trees from certain families2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45295252002-08-25Paper
https://portal.mardi4nfdi.de/entity/Q45293002002-06-24Paper
https://portal.mardi4nfdi.de/entity/Q27610412001-12-17Paper
https://portal.mardi4nfdi.de/entity/Q49339302000-06-04Paper
On the log-product of the subtree-sizes of random trees1999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q43933031998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43932551998-06-08Paper
On the number of induced subgraphs of trees1997-09-09Paper
https://portal.mardi4nfdi.de/entity/Q48876911997-03-06Paper
https://portal.mardi4nfdi.de/entity/Q56881041997-01-23Paper
On the total distance between nodes in tournaments1997-01-13Paper
Some determinant expansions and the matrix-tree theorem1996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48737631996-04-22Paper
On the adjoint of a matrix associated with trees1995-11-05Paper
The number of 4-cycles in triangle-free oriented graphs1995-08-27Paper
On path entropy functions for rooted trees1995-04-17Paper
https://portal.mardi4nfdi.de/entity/Q43252951995-03-08Paper
https://portal.mardi4nfdi.de/entity/Q42835141995-01-09Paper
https://portal.mardi4nfdi.de/entity/Q43047711994-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43043871994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42946171994-08-02Paper
IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES1994-04-21Paper
A limiting theorem for parsimoniously bicoloured trees1994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q52878721993-08-05Paper
https://portal.mardi4nfdi.de/entity/Q52855411993-06-29Paper
The permuted analogues of three Catalan sets1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40284591993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40271801993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40146281992-10-18Paper
The asymptotic behaviour of coefficients of powers of certain generating functions1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q31994301990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34718401990-01-01Paper
Erratum: On an asymptotic method in enumeration1989-01-01Paper
On an asymptotic method in enumeration1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52021981988-01-01Paper
Survival under random coverings of trees1988-01-01Paper
Statistical tests on two characteristics of the shapes of cluster diagrams1988-01-01Paper
Amalgamation of team tournaments1988-01-01Paper
On maximal independent sets of nodes in trees1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38122571988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079261988-01-01Paper
On Major and Minor Branches of Rooted Trees1987-01-01Paper
The number of trees with a 1-factor1987-01-01Paper
Some asymptotic results useful in enumeration problems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37787831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47246531986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225221985-01-01Paper
On random mapping patterns1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792071984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37014321984-01-01Paper
On an asymptotic evaluation of the cycle index of the symmetric group1983-01-01Paper
On generic forms of complementary graphs1983-01-01Paper
Hereditarily finite sets and identity trees1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33187941983-01-01Paper
On Level Numbers of t-Ary Trees1983-01-01Paper
The number of tournaments with a unique spanning cycle1982-01-01Paper
The outer-distance of nodes in random trees1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39272731981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39490721981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39675481981-01-01Paper
Lattice paths in regions with the Catalan property1980-01-01Paper
On Horton's Law for Random Channel Networks1980-01-01Paper
On the Order of Random Channel Networks1980-01-01Paper
Some enumeration problems for similarity relations1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38873651979-01-01Paper
Tournaments whose Subtournaments are Irreducible or Transitive1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38567841978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467351978-01-01Paper
On the Altitude of Nodes in Random Trees1978-01-01Paper
Path node-covering constants for certain families of trees1978-01-01Paper
Climbing certain types of rooted trees. II1978-01-01Paper
Enumerating a class of nested group testing procedures1977-01-01Paper
Erratum: On the Distribution of Crossings in Random Complete Graphs1977-01-01Paper
Packing and covering constants for certain families of trees. I1977-01-01Paper
Packing and Covering Constants for Certain Families of Trees. II1977-01-01Paper
A problem on arcs without bypasses in tournaments1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40857391976-01-01Paper
A Problem on Rankings by Committees1976-01-01Paper
A note on matrics with given diagonal entries1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773081975-01-01Paper
Relations between packing and covering numbers of a tree1975-01-01Paper
On Refining Partitions1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40857401975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773141974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773231974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773251974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773261974-01-01Paper
Cutting down recursive trees1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506191974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775151973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56801481973-01-01Paper
Random walks on random trees1973-01-01Paper
Random packings and coverings in random trees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32152441973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44014621973-01-01Paper
Almost all Graphs have a Spanning Cycle1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56589231972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595551972-01-01Paper
Cycles in k-strong tournaments1972-01-01Paper
Embedding tournaments in simple tournaments1972-01-01Paper
Arc Mappings and Tournament Isomorphisms1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56183791971-01-01Paper
The lengths of limbs of random trees1971-01-01Paper
On maximal transitive subtournaments1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56506911971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56506921971-01-01Paper
A problem on random trees1971-01-01Paper
The distance between points in random trees1970-01-01Paper
Cutting down random trees1970-01-01Paper
On Generalized Tournament Matrices1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56071171970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56167241970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56266881970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56617361970-01-01Paper
On the composition of two tournaments1970-01-01Paper
Climbing random trees1970-01-01Paper
Connected graphs with unlabeled end-points1969-01-01Paper
The number of labeled k-trees1969-01-01Paper
Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55762431969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55859101969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55960921969-01-01Paper
On the maximum degree in a random tree1969-01-01Paper
On Independent Complete Subgraphs in a Graph1968-01-01Paper
On the Correlation Function of Random Binary Sequences1968-01-01Paper
The Group of the Composition of Two Tournaments1968-01-01Paper
On nodes of degree two in random trees1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55851951968-01-01Paper
A Tree Counting Problem1968-01-01Paper
Some packing and covering theorems1967-01-01Paper
On the powers of tournament matrices1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56026861967-01-01Paper
Generating oriented graphs by means of team comparisons1967-01-01Paper
On Subtournaments of a Tournament1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55177431966-01-01Paper
Disjoint Triangles in Chromatic Graphs1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55229361966-01-01Paper
On the Maximum Order of the Group of a Tournament1966-01-01Paper
A Matrix Reduction Problem1966-01-01Paper
A Note on Approximating Symmetric Relations by Equivalence Relations1966-01-01Paper
The Maximum Diameter of a Convex Polyhedron1965-01-01Paper
On extremal graphs containing no wheels1965-01-01Paper
On a Problem of Ore1965-01-01Paper
On minimal n-universal graphs1965-01-01Paper
On the Distribution of Crossings in Random Complete Graphs1965-01-01Paper
On the Number of Complete Subgraphs of a Graph1965-01-01Paper
On Sets of Consistent Arcs in a Tournament1965-01-01Paper
On cliques in graphs1965-01-01Paper
On the diameter of a graph1965-01-01Paper
A Problem in Graph Theory1964-01-01Paper
The second moment of the complexity of a graph1964-01-01Paper
On Edge-Disjoint Cycles in a Graph1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55418761964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57323351964-01-01Paper
Tournaments With a Given Automorphism Group1964-01-01Paper
On Subgraphs of the Complete Bipartite Graph1964-01-01Paper
On the Line-Graph of the Complete Bigraph1963-01-01Paper
Triangular Dissections of N-Gons1963-01-01Paper
Another Proof of Cayley's Formula for Counting Trees1963-01-01Paper
An extension of Landau's theorem on tournaments1963-01-01Paper
Simple paths on polyhedra1963-01-01Paper
On Hamiltonian bipartite graphs1963-01-01Paper
A note on 'pattern variants on a square field'1963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57212111962-01-01Paper
On the Score Sequence of an N-Partite Tournament1962-01-01Paper
Almost all Tournaments are Irreducible1962-01-01Paper
On the Distribution of 4-Cycles in Random Bipartite Tournaments1962-01-01Paper
On Chromatic Bipartite Graphs1962-01-01Paper
On Round-Robin Tournaments with a Unique Maximum Score0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: John W. Moon