The following pages link to G. O. Mota (Q2091803):
Displaying 49 items.
- (Q322339) (redirect page) (← links)
- Path decompositions of regular graphs with prescribed girth (Q322341) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- A counting lemma for sparse pseudorandom hypergraphs (Q324872) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- On an anti-Ramsey threshold for random graphs (Q402453) (← links)
- On the number of orientations of random graphs with no directed cycles of a given length (Q405150) (← links)
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version (Q510620) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- On the number of \(r\)-transitive orientations of \(G(n,p)\) (Q1689921) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Anti-Ramsey threshold of cycles (Q2091804) (← links)
- Anti-Ramsey threshold of cycles for sparse graphs (Q2132335) (← links)
- On edge-magic labelings of forests (Q2132357) (← links)
- Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges (Q2132389) (← links)
- The multicolour size-Ramsey number of powers of paths (Q2200928) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Ramsey numbers for bipartite graphs with small bandwidth (Q2346589) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- Counting results for sparse pseudorandom hypergraphs. I. (Q2400983) (← links)
- Counting results for sparse pseudorandom hypergraphs. II. (Q2400984) (← links)
- Decomposing regular graphs with prescribed girth into paths of given length (Q2403689) (← links)
- On the local density problem for graphs of given odd-girth (Q2413148) (← links)
- Counting orientations of graphs with no strongly connected tournaments (Q2675820) (← links)
- The anti-Ramsey threshold of complete graphs (Q2689511) (← links)
- A note on counting orientations (Q2840675) (← links)
- On an anti-Ramsey property of random graphs (Q2840714) (← links)
- On an anti‐Ramsey threshold for sparse graphs with one triangle (Q4604025) (← links)
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth (Q4611005) (← links)
- Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
- The size‐Ramsey number of powers of bounded degree trees (Q5006327) (← links)
- Counting restricted orientations of random graphs (Q5128751) (← links)
- The size-Ramsey number of 3-uniform tight paths (Q5162869) (← links)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← links)
- The size‐Ramsey number of powers of paths (Q5229536) (← links)
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- (Q5419960) (← links)
- (Q5884595) (← links)
- Decomposing split graphs into locally irregular graphs (Q5918672) (← links)
- Decomposing split graphs into locally irregular graphs (Q5919073) (← links)
- Factors in randomly perturbed hypergraphs (Q6074679) (← links)
- Counting orientations of random graphs with no directed <i>k</i>‐cycles (Q6201038) (← links)
- The anti-Ramsey threshold of complete graphs (Q6313423) (← links)
- The size-Ramsey number of powers of bounded degree trees (Q6621160) (← links)
- Covering 3-coloured random graphs with monochromatic trees (Q6621232) (← links)
- Directed graphs with lower orientation Ramsey thresholds (Q6658478) (← links)
- A canonical Ramsey theorem for even cycles in random graphs (Q6754558) (← links)
