The following pages link to (Q3880849):
Displaying 50 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)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Average distance in weighted graphs (Q658013) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- Alternating-sign matrices and domino tilings. II (Q685998) (← links)
- Spectra, Euclidean representations and clusterings of hypergraphs (Q686145) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- List colourings of planar graphs (Q687126) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Alternating Whitney sums and matchings in trees. II (Q753825) (← links)
- Applications of antilexicographic order. I: An enumerative theory of trees (Q757391) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Bounds on graph spectra (Q792343) (← links)
