The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- Infinite families of new semifields (Q624210) (← links)
- On the edge-density of 4-critical graphs (Q624211) (← links)
- Every non-Euclidean oriented matroid admits a biquadratic final polynomial (Q624213) (← links)
- Monochromatic triangles in two-colored plane (Q624214) (← links)
- A superadditivity and submultiplicativity property for cardinalities of sumsets (Q653776) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- On the limit of large girth graph sequences (Q653833) (← links)
- Non-separating even cycles in highly connected graphs (Q653835) (← links)
- The generalized almost resolvable cycle system problem (Q653836) (← links)
- On properties of random dissections and triangulations (Q653837) (← links)
- The homology of a locally finite graph with ends (Q653838) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
- Linear algebra methods for Forbidden configurations (Q653981) (← links)
- Eulerian edge sets in locally finite graphs (Q653982) (← links)
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers (Q653983) (← links)
- Destroying cycles in digraphs (Q653984) (← links)
- Monochromatic integers adding to polynomials of prime variables (Q653985) (← links)
- The structure of hereditary properties and 2-coloured multigraphs (Q653987) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- Chevalley's theorem with restricted variables (Q653989) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- A \(q\)-analogue of the FKG inequality and some applications (Q653991) (← links)
- Hereditary quasirandom properties of hypergraphs (Q653992) (← links)
- An infinite combinatorial statement with a poset parameter (Q653993) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- Ramsey theorems for product of finite sets with submeasures (Q653997) (← links)
- Affine extractors over prime fields (Q653998) (← links)
- Some constructions of highly arc-transitive digraphs (Q653999) (← links)
- Binary subtrees with few labeled paths (Q654001) (← links)
- Towards dimension expanders over finite fields (Q654002) (← links)
- A local criterion for Tverberg graphs (Q654004) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- On planarity of compact, locally connected, metric spaces (Q654007) (← links)
- Erratum. Punctured combinatorial Nullstellensätze (Q654008) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- Powers of Hamilton cycles in pseudorandom graphs (Q681592) (← links)
- The typical structure of graphs with no large cliques (Q681594) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Lifts, derandomization, and diameters of Schreier graphs of Mealy automata (Q681602) (← links)
- An exponential-type upper bound for Folkman numbers (Q681604) (← links)
- Infinitely connected subgraphs in graphs of uncountable chromatic number (Q681605) (← links)
