The following pages link to (Q3852212):
Displayed 50 items.
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Counting ordered graphs that avoid certain subgraphs (Q279199) (← links)
- A remark on matrix rigidity (Q293150) (← links)
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs (Q326810) (← links)
- Extremal results for random discrete structures (Q350549) (← links)
- On a conjecture on the balanced decomposition number (Q389207) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Forcing \(k\)-repetitions in degree sequences (Q405103) (← links)
- Extremal problems for the \(p\)-spectral radius of graphs (Q405309) (← links)
- Super cyclically edge connected transitive graphs (Q411230) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Tournaments with near-linear transitive subsets (Q462934) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- New bounds on \(\bar{2}\)-separable codes of length 2 (Q488247) (← links)
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Generalizing vertex pancyclic and \(k\)-ordered graphs (Q497349) (← links)
- On saturation games (Q499485) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Independent sets in graphs (Q501998) (← links)
- Extremality of degree-based graph entropies (Q506695) (← links)
- Near packings of two graphs (Q512568) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- The binding number of a graph and its pancyclism (Q580376) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- On some extremal connectivity results for graphs and matroids (Q594104) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Regular subgraphs of almost regular graphs (Q595688) (← links)
- Topological cliques of random graphs (Q599826) (← links)
- A new class of Ramsey-Turán problems (Q607020) (← links)
- Large joints in graphs (Q607362) (← links)
- Completing partial packings of bipartite graphs (Q640856) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Query strategies for priced information (Q696973) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- Girth and treewidth (Q707020) (← links)
- On the Ramsey numbers for stars versus complete graphs (Q709240) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Diameter graphs in \({\mathbb R}^4\) (Q741607) (← links)