The following pages link to Carlos Hoppen (Q322297):
Displaying 50 items.
- A rainbow Erdős-Rothschild problem (Q322299) (← links)
- Edge-colorings avoiding fixed rainbow stars (Q324811) (← links)
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- Densities in large permutations and parameter testing (Q338581) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- Testing permutation properties through subpermutations (Q551179) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Stability of extremal hypergraphs with applications to an edge-coloring problem (Q1689923) (← links)
- Estimating the distance to a hereditary graph property (Q1689980) (← links)
- Packing arborescences in random digraphs (Q1689982) (← links)
- Local algorithms, regular graphs of large girth, and random regular graphs (Q1715061) (← links)
- Limits of \(k\)-dimensional poset sequences (Q1752500) (← links)
- Limits of permutation sequences (Q1932475) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- Total domination in regular graphs (Q2132388) (← links)
- Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges (Q2132389) (← links)
- The spectrum of a class of uniform hypergraphs (Q2174492) (← links)
- Locating the eigenvalues for graphs of small clique-width (Q2294708) (← links)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
- On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696) (← links)
- Spectral norm of oriented graphs (Q2419052) (← links)
- On the sum of the Laplacian eigenvalues of a tree (Q2431198) (← links)
- Characterizing trees with large Laplacian energy (Q2437344) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- Asymptotic bounds on total domination in regular graphs (Q2659200) (← links)
- Counting orientations of graphs with no strongly connected tournaments (Q2675820) (← links)
- Graphs with many edge-colorings such that complete graphs are rainbow (Q2700627) (← links)
- A note on random k-dimensional posets (Q2840682) (← links)
- Kneser Colorings of Uniform Hypergraphs (Q2851466) (← links)
- (Q2857331) (← links)
- (Q2857389) (← links)
- Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size (Q2883863) (← links)
- (Q2959918) (← links)
- Geodesics and almost geodesic cycles in random regular graphs (Q3081309) (← links)
- Domination and Spectral Graph Theory (Q3384115) (← links)
- Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
- A Rainbow Erdös--Rothschild Problem (Q4596826) (← links)
- Packing Arborescences in Random Digraphs (Q4627483) (← links)
- Estimating parameters associated with monotone properties (Q4636468) (← links)
- Edge‐colorings avoiding rainbow stars (Q4638637) (← links)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
