
	Where results make sense

Topic: Yair Caro

Related Topics

Marc Caro

Anthony Caro

Caro, Michigan

Joseph ben Ephraim Caro

Nydia Caro

Elme Marie Caro

Anthony Alfred Caro

Mike Caro

Heinrich Caro

Cardenal Caro

Sir Anthony Alfred Caro

Yair Caro

In the News (Fri 13 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Unsolved Problems
		Yair Caro: Solved by Taskinov in 1982 and the proof is not 65 pages.
		Yair Caro: f(4,n) essentially solved recently by Furedi.
		Yair Caro: There are many partial results obtained in the last 10 years or so.
	www.math.fau.edu /locke/unsolved.htm (2911 words)

	DBLP: Yair Caro
		Yair Caro, Dieter Rautenbach: Reconstructing graphs from size and degree properties of their induced k-subgraphs.
		Yair Caro, Ilia Krasikov, Yehuda Roditty: On induced subgraphs of trees, with restricted degrees.
		Yair Caro, Yehuda Roditty: A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/c/Caro:Yair.html (550 words)

	DBLP: Yair Caro
		Yair Caro, Raphael Yuster: Edge coloring complete uniform hypergraphs with many components.
		Yair Caro, Raphael Yuster: 2-connected graphs with small 2-connected dominating sets.
		Yair Caro, Raphael Yuster: Dominating A Family Of Graphs With Small Connected Subgraphs.
	www.vldb.org /dblp/db/indices/a-tree/c/Caro:Yair.html (436 words)

	Unsolved Problems (Part 3)
		Caro, Y. Binomial coefficients and zero-sum Ramsey numbers.
		It is known (Sutner 1989, Caro 1996 in a general setting) that every graph G has a non-zero (mod 2) dominating set (and hence non-zero (mod k) dominating set for k even).
		There are several papers written recently on odd-domination in graph (the minimum cardinality of non-zero (mod 2) dominating set).
	www.math.fau.edu /locke/unsolv3.htm (1222 words)

	Comment on A Turan type problem... (Site not responding. Last check: 2007-11-04)
		A revised version of this paper addressing this comment can be found in [CaYu04].
		[CaYu04] Y. Caro and R. Yuster, A Turán Type Problem Concerning the Powers of the Degrees of a Graph (revised) arXiv:math.CO/0401398 (2004).
		[Pi01] O. Pikhurko, Remarks on a paper of Y. Caro and R. Yuster on a Turán problem arXiv:math.CO/0101235 (2001).
	www.univie.ac.at /EMIS/journals/EJC/Volume_7/Comments/v7i1r47comments.html (177 words)

	Feedback on Opinion 51 of Doron Zeilberger
		Feedback by Noga Alon and Yair Caro on Opinion 51
		Of course I don't quite agree with the content of Opinion 51, but I can appreciate the reasoning; personally, I still find some value in the fact that I know a quick reason for the fact that 8765432187654321876543218765432187654321 is composite, and I will be less satisfied with a computer telling me that's the case.
		While I am not sure about the philosophic attitude to this question it seems to me clear that if the program "belongs" to the programmer than "shallow" goes on to the results of computer finding.
	www.math.rutgers.edu /~zeilberg/fb51.html (817 words)

	yair caro - ResearchIndex document query
		Graphs Having the Local Decomposition Property Yair Caro Raphael Yuster y Abstract Let H be a fixed
		Space of Hypergraphs and its Applications Yair Caro Raphael Yuster y Abstract Let H =V E) Space of Hypergraphs and its Applications Yair Caro, Raphael Yuste
		Graphs with Large Variance Yair Caro Raphael Yuster y Abstract For a graph G, Graphs with Large Variance Yair Caro, Raphael Yuste
	citeseer.ist.psu.edu /cis?q=Yair+Caro (594 words)

	[No title] (Site not responding. Last check: 2007-11-04)
		v97w10n3 Subject: From the Electronic Journal of Combinatorics Volume 4, No. 1, Paper R10: Caro, Yuster: Efficient Covering Designs of the Complete Graph Sender: ejc@math.gatech.edu Primary: 05-xx Secondary: 90c27 Category: Publications/elecjcomb This is a message from the subscription service of the Electronic Journal of Combinatorics.
		Title: Efficient Covering Designs of the Complete Graph Authors: Yair Caro and Raphael Yuster Abstract: Let $H$ be a graph.
		We show that there exists $n_0=n_0(H)$ such that for {\it every} $n \geq n_0$, there is a covering of the edges of $K_n$ with copies of $H$ where every edge is covered at most twice and any two copies intersect in at most one edge.
	elib.zib.de /pub/opt-net/ams/msc-05-xx/05-xx/v97w10n3 (142 words)

	DBLP: Raphael Yuster
		Raphael Yuster: The number of edge-disjoint transitive triples in a tournament.
		Noga Alon, Simon Litsyn, Raphael Yuster: A Coding Theory Bound and Zero-Sum Square Matrices.
		Jian Shen, Raphael Yuster: A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs.
	www.vldb.org /dblp/db/indices/a-tree/y/Yuster:Raphael.html (770 words)

	raphael yuster - ResearchIndex document query
		Endre Boros #Yair Caro Zoltan Furedi #Raphael Yuster Abstract A subset of the vertices in a
		With Minimum Overlap Noga Alon, Yair Caro, Raphael Yuster
		Many Leaves Yair Caro Douglas B. West y Raphael Yuster z Abstract Let G =V E) be a connected
	citeseer.ist.psu.edu /cis?q=Raphael+Yuster (572 words)

	The Colorist Chess Collaborative Public Wall In Progress at Caro d'Offay Images
		The Colorist Chess Collaborative Public Wall In Progress at Caro d'Offay Images
		Though each move is documented, application events result in drawings which we can only document on paper at this point.
		Green looping line within pink area (See diagram)
	www.carodoffaygallery.com /ColoristChessWall.html (294 words)

Try your search on: Qwika (all wikis)