The following pages link to Péter L. Erdős (Q200913):
Displaying 50 items.
- On infinite-finite duality pairs of directed graphs (Q382885) (← links)
- Two-part set systems (Q426823) (← links)
- Asymptotically normal distribution of some tree families relevant for phylogenectics, and of partitions without singletons (Q446288) (← links)
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- On realizations of a joint degree matrix (Q479053) (← links)
- (Q587136) (redirect page) (← links)
- No finite-infinite antichain duality in the homomorphism poset of directed graphs (Q603883) (← links)
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- A tour of \(M\)-part \(L\)-Sperner families (Q618322) (← links)
- (Q681596) (redirect page) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- A new bijection on rooted forests (Q686461) (← links)
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Applications of antilexicographic order. I: An enumerative theory of trees (Q757391) (← links)
- An Erdős-Ko-Rado theorem for the subcubes of a cube (Q762158) (← links)
- Decomposition of large uniform hypergraphs (Q762500) (← links)
- (Q796531) (redirect page) (← links)
- Intersecting Sperner families and their convex hulls (Q796532) (← links)
- Polytopes determined by complementfree Sperner families (Q810022) (← links)
- An Erdős--Ko--Rado theorem for partial permutations (Q817754) (← links)
- Competition hypergraphs of products of digraphs (Q844216) (← links)
- Tracing a single user (Q850073) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- Product representations of polynomials (Q850085) (← links)
- The maximum size of 3-wise \(t\)-intersecting families (Q854817) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- On set systems with a threshold property (Q856857) (← links)
- Two equivalent measures on weighted hypergraphs (Q860393) (← links)
- A note on the jumping constant conjecture of Erdős (Q864899) (← links)
- Subwords in reverse-complement order (Q882766) (← links)
- Sperner families satisfying additional conditions and their convex hulls (Q921020) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- A note on the structure of Turán densities of hypergraphs (Q937246) (← links)
- Small maximally disjoint union-free families (Q941357) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- An exact Turán result for the generalized triangle (Q949792) (← links)
- Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs (Q949799) (← links)
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs (Q976717) (← links)
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance (Q997423) (← links)
- On a generalization of the van der Waerden theorem (Q1003615) (← links)
- Quasi-kernels and quasi-sinks in infinite graphs (Q1025921) (← links)
- (Q1057878) (redirect page) (← links)
- Threshold hypergraphs (Q1057879) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- Component structure in the evolution of random hypergraphs (Q1063043) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
