Person:168472: Difference between revisions

From MaRDI portal
Person:168472
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Yair Caro to Yair Caro: Duplicate
 
(No difference)

Latest revision as of 12:51, 8 December 2023

Available identifiers

zbMath Open caro.yairDBLP34/5039WikidataQ20502773 ScholiaQ20502773MaRDI QIDQ168472

List of research outcomes





PublicationDate of PublicationType
Monochromatic graph decompositions inspired by anti-Ramsey colorings2025-01-27Paper
The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.2024-11-28Paper
Flip colouring of graphs2024-11-04Paper
Recent developments on unavoidable patterns in 2-colorings of the complete graph2024-10-18Paper
Connected Turán number of trees2024-10-15Paper
Counting connected partitions of graphs2024-09-16Paper
Flip colouring of graphs2023-12-14Paper
The Feasibility Problem -- the family ${\cal F}$$(G)$ of all induced $G$-free graphs2023-11-02Paper
Unavoidable chromatic patterns in 2‐colorings of the complete graph2023-09-29Paper
Graphs isomorphisms under edge-replacements and the family of amoebas2023-08-18Paper
Sum-distinguishing number of sparse hypergraphs2023-07-18Paper
https://portal.mardi4nfdi.de/entity/Q58835092023-03-21Paper
https://portal.mardi4nfdi.de/entity/Q50570662022-12-14Paper
Remarks on proper conflict-free colorings of graphs2022-11-23Paper
The feasibility problem for line graphs2022-11-11Paper
Counting Connected Partitions of Graphs2022-10-20Paper
Conjecture of TxGraffiti: Independence, domination, and matchings2022-09-28Paper
Remarks on odd colorings of graphs2022-09-15Paper
Connected Tur\'an number of trees2022-08-12Paper
On small balanceable, strongly-balanceable and omnitonal graphs2022-07-26Paper
Higher Degree Erdos-Ginzburg-Ziv Constants2022-07-18Paper
New results relating independence and matchings2022-07-01Paper
Index of parameters of iterated line graphs2022-05-27Paper
The evolution of unavoidable bi-chromatic patterns and extremal cases of balanceability2022-04-08Paper
Higher Degree Davenport Constants over Finite Commutative Rings2022-03-24Paper
On zero-sum spanning trees and zero-sum connectivity2022-02-01Paper
Partial domination - the isolation number of a graph2021-11-01Paper
Irregular independence and irregular domination2021-05-19Paper
Recursive constructions of amoebas2021-04-19Paper
Regular Tur\'an numbers2020-12-10Paper
A note on totally-omnitonal graphs2020-07-10Paper
Induced subgraphs with many repeated degrees2020-03-20Paper
Maximum Oriented Forcing Number for Complete Graphs2019-12-13Paper
Directed domination in oriented hypergraphs2019-11-08Paper
Dynamic approach to k-forcing2019-07-22Paper
Eternal Independent Sets in Graphs2019-07-22Paper
Two short proofs of the Perfect Forest Theorem2019-07-22Paper
Singular Ramsey and Turán numbers2019-07-22Paper
Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)2019-06-28Paper
Extremal \(k\)-forcing sets in oriented graphs2019-05-23Paper
Notes on Spreads of Degrees in Graphs2019-05-16Paper
Equating two maximum degrees2019-02-13Paper
The effect of local majority on global majorityin connected graphs2019-01-11Paper
Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences2018-11-08Paper
Degree Monotone Paths and Graph Operations2017-02-17Paper
Ramsey numbers for degree monotone paths2016-12-14Paper
https://portal.mardi4nfdi.de/entity/Q28288602016-10-26Paper
Isolation in graphs2016-10-17Paper
Regular independent sets2016-03-18Paper
On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)2016-03-02Paper
Selective hypergraph colourings2016-01-21Paper
Independence and Matchings in $\sigma$-hypergraphs2015-11-16Paper
Degree Monotone Paths2015-08-05Paper
The saturation number for the length of degree monotone paths2015-08-04Paper
\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs2015-04-28Paper
Constrained colouring and \(\sigma\)-hypergraphs2015-03-04Paper
Simultaneous domination in graphs2015-01-20Paper
Upper bounds on the \(k\)-forcing number of a graph2014-12-05Paper
Forcing \(k\)-repetitions in degree sequences2014-09-04Paper
Degree Sequence Index Strategy2014-08-15Paper
Partitions of graphs into small and large sets2014-04-22Paper
Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs2014-01-27Paper
New approach to the \(k\)-independence number of a graph2013-06-07Paper
Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number2012-10-24Paper
Fair domination in graphs2012-09-12Paper
Directed domination in oriented graphs2012-05-30Paper
A greedy partition lemma for directed domination2012-03-07Paper
Colorful monochromatic connectivity2011-08-08Paper
Equitable hypergraph orientations2011-06-01Paper
Large induced subgraphs with equated maximum degree2010-04-27Paper
Large disjoint subgraphs with the same order and size2009-06-17Paper
On rainbow connection2009-04-07Paper
Repetition number of graphs2009-04-07Paper
Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs2007-03-02Paper
Connected odd dominating sets in graphs2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54755292006-06-26Paper
https://portal.mardi4nfdi.de/entity/Q54660782005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q27159812005-07-20Paper
Edge coloring complete uniform hypergraphs with many components2004-08-06Paper
On non-z(mod k) dominating sets2004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44059182003-09-30Paper
The order of monochromatic subgraphs with a given minimum degree2003-09-24Paper
2-connected graphs with small 2-connected dominating sets.2003-08-19Paper
Zero-sum square matrices2003-03-18Paper
Covering non-uniform hypergraphs2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45521712002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45522272002-08-29Paper
On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges2002-05-28Paper
Odd and residue domination numbers of a graph2002-03-24Paper
List decomposition of graphs.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27609912001-12-17Paper
https://portal.mardi4nfdi.de/entity/Q27136042001-06-10Paper
Asymptotic bounds for bipartite Ramsey numbers2001-03-29Paper
Dominating a Family of Graphs with Small Connected Subgraphs2001-03-27Paper
Intersecting designs2001-02-05Paper
Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers2001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27651662001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44874552000-12-03Paper
A Turán type problem concerning the powers of the degrees of a graph2000-11-30Paper
A characterization of Zm-well-covered graphs of girth 6 or more2000-09-15Paper
Connected Domination and Spanning Trees with Many Leaves2000-07-20Paper
Zero-sum delta-systems and multiple copies of graphs2000-06-21Paper
Graph decomposition of slim graphs2000-06-04Paper
The uniformity space of hypergraphs and its applications2000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42429592000-01-11Paper
Orthogonal decomposition and packing of complete graphs1999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42560021999-10-06Paper
Recognizing global occurrence of local properties1999-08-02Paper
https://portal.mardi4nfdi.de/entity/Q42221711999-06-21Paper
Covering graphs: The covering problem solved1999-06-08Paper
On colored designs. I1999-05-31Paper
Orthogonal colorings of graphs1999-02-02Paper
Covering the edges of a graph by a prescribed tree with minimum overlap1999-02-01Paper
Local Structure When All Maximal Independent Sets Have Equal Weight1998-09-21Paper
Binomial coefficients and zero-sum Ramsey numbers1998-02-22Paper
Packing graphs: The packing problem solved1998-02-12Paper
Efficient covering designs of the complete graph1998-02-12Paper
Problems in Zero-Sum Combinatorics1997-11-17Paper
Subdivisions, parity and well-covered graphs1997-10-26Paper
On the generalized Erdös-Szekeres conjecture -- a new upper bound1997-08-21Paper
Remarks on a zero-sum theorem1997-06-17Paper
Two combinatorial problems on posets1997-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48651401997-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48829771996-11-25Paper
Zero-sum problems -- a survey1996-09-05Paper
https://portal.mardi4nfdi.de/entity/Q48566161996-04-29Paper
Zero-sum subsequences in Abelian non-cyclic groups1996-03-05Paper
Recognizing Greedy Structures1996-02-20Paper
On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell1995-09-12Paper
On colored designs. II1995-08-27Paper
Zero-sum partition theorems for graphs1995-03-20Paper
On induced subgraphs with odd degrees1995-03-09Paper
A complete characterization of the zero-sum (mod 2) Ramsey numbers1994-11-22Paper
A linear upper bound in zero-sum Ramsey theory1994-10-09Paper
Zero-sum bipartite Ramsey numbers1994-05-30Paper
Acyclic edge-colorings of sparse graphs1994-05-24Paper
Bounded degrees and prescribed distances in graphs1994-05-05Paper
On induced subgraphs of trees, with restricted degrees1994-05-05Paper
ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS1994-05-05Paper
On three zero‐sum Ramsey‐type problems1994-03-13Paper
Bisection of trees and sequences1993-10-24Paper
https://portal.mardi4nfdi.de/entity/Q42015611993-08-25Paper
ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS1993-02-18Paper
On zero-sum Ramsey numbers--stars1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40153111993-01-06Paper
https://portal.mardi4nfdi.de/entity/Q40143051992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q40143211992-10-06Paper
On several variations of the turan and ramsey numbers1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39910161992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39910171992-06-28Paper
On zero‐sum delta‐systems and multiple copies of hypergraphs1992-06-27Paper
Improved lower bounds on k‐independence1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47118951992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47120201992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47120321992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47130341992-06-25Paper
Hypergraph coverings and local colorings1991-01-01Paper
On the largest tree of given maximum degree in a connected graph1991-01-01Paper
Generalized sum-free subsets1990-01-01Paper
A note on packing trees into complete bipartite graphs and on Fishburn's conjecture1990-01-01Paper
A note on the k-domination number of a graph1990-01-01Paper
Sub-Ramsey numbers of arithmetic progressions1989-01-01Paper
Combinatorial reconstruction problems1989-01-01Paper
Decomposition of large combinatorial structures1989-01-01Paper
Decompositions of partially ordered sets into chains and antichains of given size1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322831988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079271988-01-01Paper
Extremal problems concerning transformations of the edges of the complete hypergraphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38244241987-01-01Paper
Extremal problems concerning transformations of the set of edges of the complete graph1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433211986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37524041986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187541985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187551985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37605741985-01-01Paper
The decomposition of trees into subtrees1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808521984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39675471982-01-01Paper
Generalized 1-factorization of trees1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015341980-01-01Paper
On a division property of consecutive integers1979-01-01Paper
Edge mappings of graphs: Ramsey type parametersN/APaper
Edge mappings of graphs: Tur\'an type parametersN/APaper
On $(r,c)$-constant, planar and circulant graphsN/APaper

Research outcomes over time

This page was built for person: Yair Caro