The following pages link to (Q3880849):
Displaying 48 items.
- Pattern matching for permutations (Q293263) (← links)
- Order-preserving indexing (Q294954) (← links)
- A generalization of Sperner's theorem on compressed ideals (Q311527) (← links)
- Graph invertibility and median eigenvalues (Q344913) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- General graph pebbling (Q385150) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs (Q409406) (← links)
- Two counterexamples on completely independent spanning trees (Q409435) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- Super restricted edge connectivity of regular edge-transitive graphs (Q423941) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height (Q470959) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- Super \(s\)-restricted edge-connectivity of vertex-transitive graphs (Q477258) (← links)
- Boolean algebras and Lubell functions (Q490915) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- A size-sensitive inequality for cross-intersecting families (Q518199) (← links)
- Bounds on connective constants of regular graphs (Q520036) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Color-critical graphs have logarithmic circumference (Q550393) (← links)
- Subgroups of graph groups (Q579412) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Graph groups, coherence, and three-manifolds (Q583228) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Strong properties in partially ordered sets. I (Q585230) (← links)
- The distribution of the size of the union of cycles for two types of random permutations (Q606425) (← links)
- Large joints in graphs (Q607362) (← links)
- Hyper-Hamiltonian circulants (Q4958058) (← links)
- Traces of hypergraphs (Q4973667) (← links)
- Wiener Index and Remoteness in Triangulations and Quadrangulations (Q4987269) (← links)
- Well-mixing vertices and almost expanders (Q5039232) (← links)
- Solution to the minimum harmonic index of graphs with given minimum degree (Q5135459) (← links)
- On a conjecture of Thomassen concerning subgraphs of large girth (Q5199421) (← links)
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs (Q5272634) (← links)
- Connectivity augmentation in plane straight line graphs (Q5300980) (← links)
- The Profile Polytope of Nontrivial Intersecting Families (Q6072292) (← links)
- Average distance, minimum degree, and irregularity index (Q6080130) (← links)
- Convergence rate for the number of crossings in a random labelled tree (Q6084751) (← links)
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations (Q6093584) (← links)
- The saturation spectrum for antichains of subsets (Q6139859) (← links)
- Intersecting families of sets are typically trivial (Q6144393) (← links)
- Four-vertex traces of finite sets (Q6144497) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- Families with restricted matching number and multiply covered shadows (Q6177434) (← links)
- A proof of Frankl's conjecture on cross-union families (Q6179324) (← links)
