The following pages link to Guillem Perarnau (Q278888):
Displaying 46 items.
- Correlation among runners and some results on the lonely runner conjecture (Q278889) (← links)
- A probabilistic approach to consecutive pattern avoiding in permutations (Q385031) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Bounds for identifying codes in terms of degree parameters (Q426794) (← links)
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402) (← links)
- Random subgraphs make identification affordable (Q501982) (← links)
- Rainbow perfect matchings in \(r\)-partite graph structures (Q510578) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree (Q1689912) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Matchings in random biregular bipartite graphs (Q1953449) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture (Q2421548) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs (Q2442427) (← links)
- On the number of coloured triangulations of \(d\)-manifolds (Q2664103) (← links)
- The diameter of the directed configuration model (Q2686613) (← links)
- On the relation between graph distance and Euclidean distance in random geometric graphs (Q2830884) (← links)
- Rainbow Matchings: existence and counting (Q2857432) (← links)
- (Q2904780) (← links)
- The Glauber dynamics for edge‐colorings of trees (Q3386527) (← links)
- Two lower bounds for $p$-centered colorings (Q3386629) (← links)
- Large Subgraphs without Short Cycles (Q3453565) (← links)
- Critical percolation on random regular graphs (Q4563646) (← links)
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture (Q4575691) (← links)
- Local convergence and stability of tight bridge-addable graph classes (Q4636459) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- The giant component of the directed configuration model revisited (Q5009813) (← links)
- Percolation on Random Graphs with a Fixed Degree Sequence (Q5020830) (← links)
- Local Convergence and Stability of Tight Bridge-addable Classes (Q5110157) (← links)
- A Rainbow Dirac's Theorem (Q5130574) (← links)
- Improved Bounds for Randomly Sampling Colorings via Linear Programming (Q5236321) (← links)
- Rainbow matchings in Dirac bipartite graphs (Q5242877) (← links)
- On Treewidth and Related Parameters of Random Geometric Graphs (Q5270409) (← links)
- Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree (Q5366947) (← links)
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting (Q5397732) (← links)
- (Q5419951) (← links)
- Speeding up random walk mixing by starting from a uniform vertex (Q6126961) (← links)
- Largest component of subcritical random graphs with given degree sequence (Q6164933) (← links)
- Rankings in directed configuration models with heavy tailed in-degrees (Q6180388) (← links)
- Short Synchronizing Words for Random Automata (Q6406364) (← links)
- Percolation on dense random graphs with given degrees (Q6500105) (← links)
