The following pages link to Yair Caro (Q168472):
Displaying 50 items.
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- The order of monochromatic subgraphs with a given minimum degree (Q1408537) (← links)
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers (Q1567606) (← links)
- A Turán type problem concerning the powers of the degrees of a graph (Q1583618) (← links)
- On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges (Q1598789) (← links)
- Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences (Q1621429) (← links)
- The effect of local majority on global majorityin connected graphs (Q1756113) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- Two combinatorial problems on posets (Q1815848) (← links)
- On colored designs. II (Q1842158) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Zero-sum square matrices (Q1864564) (← links)
- Zero-sum subsequences in Abelian non-cyclic groups (Q1905782) (← links)
- Zero-sum problems -- a survey (Q1917486) (← links)
- New approach to the \(k\)-independence number of a graph (Q1953418) (← links)
- Intersecting designs (Q1971015) (← links)
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) (Q2000579) (← links)
- Irregular independence and irregular domination (Q2026322) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- The feasibility problem for line graphs (Q2097181) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- On small balanceable, strongly-balanceable and omnitonal graphs (Q2158200) (← links)
- Remarks on odd colorings of graphs (Q2172423) (← links)
- Constrained colouring and \(\sigma\)-hypergraphs (Q2259578) (← links)
- Colorful monochromatic connectivity (Q2275401) (← links)
- Induced subgraphs with many repeated degrees (Q2305934) (← links)
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713) (← links)
- Ramsey numbers for degree monotone paths (Q2374167) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- The saturation number for the length of degree monotone paths (Q2516681) (← links)
- Remarks on a zero-sum theorem (Q2563718) (← links)
- Dominating a family of graphs with small connected subgraphs (Q2703021) (← links)
- On graphs determined by their \(k\)-subgraphs (Q2713604) (← links)
- Graphs with large variance. (Q2715981) (← links)
- Graphs having the local decomposition property (Q2760991) (← links)
- Orthogonal \(H\)-decompositions. (Q2765166) (← links)
- Odd and residue domination numbers of a graph (Q2773048) (← links)
- Barycentric and zero-sum Ramsey numbers. (Q2828860) (← links)
- Degree sequence index strategy (Q2876022) (← links)
- Degree Monotone Paths and Graph Operations (Q2960955) (← links)
- Extremal problems concerning transformations of the edges of the complete hypergraphs (Q3027050) (← links)
- (Q3032283) (← links)
- A note on totally-omnitonal graphs (Q3295490) (← links)
- The decomposition of trees into subtrees (Q3344008) (← links)
- Higher Degree Davenport Constants over Finite Commutative Rings (Q3390101) (← links)
- Independence and Matchings in $\sigma$-hypergraphs (Q3451436) (← links)
- (Q3680852) (← links)
