About the second neighborhood problem in tournaments missing disjoint stars

<p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$....
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Salman Ghazal [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2016

Schlagwörter:	oriented graph, out-neighborhood second out-neighborhood star

Übergeordnetes Werk:	In: Electronic Journal of Graph Theory and Applications - Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013, 4(2016), 2, Seite 178-189
Übergeordnetes Werk:	volume:4 ; year:2016 ; number:2 ; pages:178-189

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.5614/ejgta.2016.4.2.6

Katalog-ID:	DOAJ042296528

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ042296528
003	DE-627
005	20230308060156.0
007	cr uuu---uuuuu
008	230227s2016 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.5614/ejgta.2016.4.2.6 \|2 doi
035			\|a (DE-627)DOAJ042296528
035			\|a (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA1-939
100	0		\|a Salman Ghazal \|e verfasserin \|4 aut
245	1	0	\|a About the second neighborhood problem in tournaments missing disjoint stars
264		1	\|c 2016
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<
650		4	\|a oriented graph, out-neighborhood
650		4	\|a second out-neighborhood
650		4	\|a star
653		0	\|a Mathematics
773	0	8	\|i In \|t Electronic Journal of Graph Theory and Applications \|d Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 \|g 4(2016), 2, Seite 178-189 \|w (DE-627)783790120 \|w (DE-600)2766635-9 \|x 23382287 \|7 nnns
773	1	8	\|g volume:4 \|g year:2016 \|g number:2 \|g pages:178-189
856	4	0	\|u https://doi.org/10.5614/ejgta.2016.4.2.6 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d \|z kostenfrei
856	4	0	\|u https://www.ejgta.org/index.php/ejgta/article/view/189 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2338-2287 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 4 \|j 2016 \|e 2 \|h 178-189

Indexfelder

author_variant	s g sg
matchkey_str	article:23382287:2016----::buteeodegbrodrbeitunmnsi
hierarchy_sort_str	2016
callnumber-subject-code	QA
publishDate	2016
allfields	10.5614/ejgta.2016.4.2.6 doi (DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d DE-627 ger DE-627 rakwb eng QA1-939 Salman Ghazal verfasserin aut About the second neighborhood problem in tournaments missing disjoint stars 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p< oriented graph, out-neighborhood second out-neighborhood star Mathematics In Electronic Journal of Graph Theory and Applications Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 4(2016), 2, Seite 178-189 (DE-627)783790120 (DE-600)2766635-9 23382287 nnns volume:4 year:2016 number:2 pages:178-189 https://doi.org/10.5614/ejgta.2016.4.2.6 kostenfrei https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d kostenfrei https://www.ejgta.org/index.php/ejgta/article/view/189 kostenfrei https://doaj.org/toc/2338-2287 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2016 2 178-189
spelling	10.5614/ejgta.2016.4.2.6 doi (DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d DE-627 ger DE-627 rakwb eng QA1-939 Salman Ghazal verfasserin aut About the second neighborhood problem in tournaments missing disjoint stars 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p< oriented graph, out-neighborhood second out-neighborhood star Mathematics In Electronic Journal of Graph Theory and Applications Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 4(2016), 2, Seite 178-189 (DE-627)783790120 (DE-600)2766635-9 23382287 nnns volume:4 year:2016 number:2 pages:178-189 https://doi.org/10.5614/ejgta.2016.4.2.6 kostenfrei https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d kostenfrei https://www.ejgta.org/index.php/ejgta/article/view/189 kostenfrei https://doaj.org/toc/2338-2287 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2016 2 178-189
allfields_unstemmed	10.5614/ejgta.2016.4.2.6 doi (DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d DE-627 ger DE-627 rakwb eng QA1-939 Salman Ghazal verfasserin aut About the second neighborhood problem in tournaments missing disjoint stars 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p< oriented graph, out-neighborhood second out-neighborhood star Mathematics In Electronic Journal of Graph Theory and Applications Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 4(2016), 2, Seite 178-189 (DE-627)783790120 (DE-600)2766635-9 23382287 nnns volume:4 year:2016 number:2 pages:178-189 https://doi.org/10.5614/ejgta.2016.4.2.6 kostenfrei https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d kostenfrei https://www.ejgta.org/index.php/ejgta/article/view/189 kostenfrei https://doaj.org/toc/2338-2287 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2016 2 178-189
allfieldsGer	10.5614/ejgta.2016.4.2.6 doi (DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d DE-627 ger DE-627 rakwb eng QA1-939 Salman Ghazal verfasserin aut About the second neighborhood problem in tournaments missing disjoint stars 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p< oriented graph, out-neighborhood second out-neighborhood star Mathematics In Electronic Journal of Graph Theory and Applications Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 4(2016), 2, Seite 178-189 (DE-627)783790120 (DE-600)2766635-9 23382287 nnns volume:4 year:2016 number:2 pages:178-189 https://doi.org/10.5614/ejgta.2016.4.2.6 kostenfrei https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d kostenfrei https://www.ejgta.org/index.php/ejgta/article/view/189 kostenfrei https://doaj.org/toc/2338-2287 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2016 2 178-189
allfieldsSound	10.5614/ejgta.2016.4.2.6 doi (DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d DE-627 ger DE-627 rakwb eng QA1-939 Salman Ghazal verfasserin aut About the second neighborhood problem in tournaments missing disjoint stars 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p< oriented graph, out-neighborhood second out-neighborhood star Mathematics In Electronic Journal of Graph Theory and Applications Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013 4(2016), 2, Seite 178-189 (DE-627)783790120 (DE-600)2766635-9 23382287 nnns volume:4 year:2016 number:2 pages:178-189 https://doi.org/10.5614/ejgta.2016.4.2.6 kostenfrei https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d kostenfrei https://www.ejgta.org/index.php/ejgta/article/view/189 kostenfrei https://doaj.org/toc/2338-2287 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 4 2016 2 178-189
language	English
source	In Electronic Journal of Graph Theory and Applications 4(2016), 2, Seite 178-189 volume:4 year:2016 number:2 pages:178-189
sourceStr	In Electronic Journal of Graph Theory and Applications 4(2016), 2, Seite 178-189 volume:4 year:2016 number:2 pages:178-189
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	oriented graph, out-neighborhood second out-neighborhood star Mathematics
isfreeaccess_bool	true
container_title	Electronic Journal of Graph Theory and Applications
authorswithroles_txt_mv	Salman Ghazal @@aut@@
publishDateDaySort_date	2016-01-01T00:00:00Z
hierarchy_top_id	783790120
id	DOAJ042296528
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ042296528</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230308060156.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2016 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.5614/ejgta.2016.4.2.6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ042296528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Salman Ghazal</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">About the second neighborhood problem in tournaments missing disjoint stars</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a"><p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">oriented graph, out-neighborhood</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">second out-neighborhood</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">star</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronic Journal of Graph Theory and Applications</subfield><subfield code="d">Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013</subfield><subfield code="g">4(2016), 2, Seite 178-189</subfield><subfield code="w">(DE-627)783790120</subfield><subfield code="w">(DE-600)2766635-9</subfield><subfield code="x">23382287</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:178-189</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.5614/ejgta.2016.4.2.6</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.ejgta.org/index.php/ejgta/article/view/189</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2338-2287</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="h">178-189</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Salman Ghazal
spellingShingle	Salman Ghazal misc QA1-939 misc oriented graph, out-neighborhood misc second out-neighborhood misc star misc Mathematics About the second neighborhood problem in tournaments missing disjoint stars
authorStr	Salman Ghazal
ppnlink_with_tag_str_mv	@@773@@(DE-627)783790120
format	electronic Article
delete_txt_mv	keep
author_role	aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	23382287
topic_title	QA1-939 About the second neighborhood problem in tournaments missing disjoint stars oriented graph, out-neighborhood second out-neighborhood star
topic	misc QA1-939 misc oriented graph, out-neighborhood misc second out-neighborhood misc star misc Mathematics
topic_unstemmed	misc QA1-939 misc oriented graph, out-neighborhood misc second out-neighborhood misc star misc Mathematics
topic_browse	misc QA1-939 misc oriented graph, out-neighborhood misc second out-neighborhood misc star misc Mathematics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Electronic Journal of Graph Theory and Applications
hierarchy_parent_id	783790120
hierarchy_top_title	Electronic Journal of Graph Theory and Applications
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)783790120 (DE-600)2766635-9
title	About the second neighborhood problem in tournaments missing disjoint stars
ctrlnum	(DE-627)DOAJ042296528 (DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d
title_full	About the second neighborhood problem in tournaments missing disjoint stars
author_sort	Salman Ghazal
journal	Electronic Journal of Graph Theory and Applications
journalStr	Electronic Journal of Graph Theory and Applications
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2016
contenttype_str_mv	txt
container_start_page	178
author_browse	Salman Ghazal
container_volume	4
class	QA1-939
format_se	Elektronische Aufsätze
author-letter	Salman Ghazal
doi_str_mv	10.5614/ejgta.2016.4.2.6
title_sort	about the second neighborhood problem in tournaments missing disjoint stars
callnumber	QA1-939
title_auth	About the second neighborhood problem in tournaments missing disjoint stars
abstract	<p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<
abstractGer	<p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<
abstract_unstemmed	<p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	2
title_short	About the second neighborhood problem in tournaments missing disjoint stars
url	https://doi.org/10.5614/ejgta.2016.4.2.6 https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d https://www.ejgta.org/index.php/ejgta/article/view/189 https://doaj.org/toc/2338-2287
remote_bool	true
ppnlink	783790120
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.5614/ejgta.2016.4.2.6
callnumber-a	QA1-939
up_date	2024-07-04T00:25:09.360Z
_version_	1803605989776162816
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ042296528</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230308060156.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2016 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.5614/ejgta.2016.4.2.6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ042296528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJcb03cc9074c0400d87339f1054e3b87d</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Salman Ghazal</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">About the second neighborhood problem in tournaments missing disjoint stars</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a"><p<Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.</p<</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">oriented graph, out-neighborhood</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">second out-neighborhood</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">star</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronic Journal of Graph Theory and Applications</subfield><subfield code="d">Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013</subfield><subfield code="g">4(2016), 2, Seite 178-189</subfield><subfield code="w">(DE-627)783790120</subfield><subfield code="w">(DE-600)2766635-9</subfield><subfield code="x">23382287</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:178-189</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.5614/ejgta.2016.4.2.6</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/cb03cc9074c0400d87339f1054e3b87d</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.ejgta.org/index.php/ejgta/article/view/189</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2338-2287</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="h">178-189</subfield></datafield></record></collection>
score	7.3990326

Nicht das Richtige dabei?

Schreiben Sie uns!

About the second neighborhood problem in tournaments missing disjoint stars

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?