The following pages link to Yair Caro (Q168472):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- Isolation in graphs (Q324891) (← links)
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs (Q394316) (← links)
- Forcing \(k\)-repetitions in degree sequences (Q405103) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Fair domination in graphs (Q449132) (← links)
- Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number (Q456338) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Simultaneous domination in graphs (Q489305) (← links)
- Equitable hypergraph orientations (Q540133) (← links)
- Sub-Ramsey numbers of arithmetic progressions (Q582303) (← links)
- Edge coloring complete uniform hypergraphs with many components (Q598467) (← links)
- On a division property of consecutive integers (Q599078) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Bisection of trees and sequences (Q685643) (← links)
- Bounded degrees and prescribed distances in graphs (Q686447) (← links)
- Generalized sum-free subsets (Q807659) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- (Q914690) (redirect page) (← links)
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture (Q914692) (← links)
- A note on the k-domination number of a graph (Q919005) (← links)
- Large induced subgraphs with equated maximum degree (Q965950) (← links)
- On rainbow connection (Q1010776) (← links)
- Repetition number of graphs (Q1010910) (← links)
- Large disjoint subgraphs with the same order and size (Q1024273) (← links)
- Extremal problems concerning transformations of the set of edges of the complete graph (Q1088678) (← links)
- Combinatorial reconstruction problems (Q1095932) (← links)
- Decomposition of large combinatorial structures (Q1107544) (← links)
- Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
- Hypergraph coverings and local colorings (Q1121913) (← links)
- On the generalized Erdös-Szekeres conjecture -- a new upper bound (Q1126297) (← links)
- Generalized 1-factorization of trees (Q1151908) (← links)
- On zero-sum Ramsey numbers--stars (Q1197001) (← links)
- Covering graphs: The covering problem solved (Q1269896) (← links)
- Orthogonal colorings of graphs (Q1277141) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Recognizing global occurrence of local properties (Q1296525) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← links)
- On induced subgraphs of trees, with restricted degrees (Q1322256) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- A linear upper bound in zero-sum Ramsey theory (Q1335521) (← links)
- A complete characterization of the zero-sum (mod 2) Ramsey numbers (Q1336447) (← links)
- On induced subgraphs with odd degrees (Q1336646) (← links)
- Zero-sum partition theorems for graphs (Q1338423) (← links)
- On colored designs. I (Q1356692) (← links)
- Binomial coefficients and zero-sum Ramsey numbers (Q1374203) (← links)
- Packing graphs: The packing problem solved (Q1378488) (← links)
- Efficient covering designs of the complete graph (Q1378499) (← links)
- Covering the edges of a graph by a prescribed tree with minimum overlap (Q1386432) (← links)
